File: PAIRLIS%24.html

package info (click to toggle)
acl2 3.1-1
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 36,712 kB
  • ctags: 38,396
  • sloc: lisp: 464,023; makefile: 5,470; sh: 86; csh: 47; cpp: 25; ansic: 22
file content (18 lines) | stat: -rw-r--r-- 977 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
<html>
<head><title>PAIRLIS$.html  --  ACL2 Version 3.1</title></head>
<body text=#000000 bgcolor="#FFFFFF">
<h2>PAIRLIS$</h2>zipper together two lists
<pre>Major Section:  <a href="PROGRAMMING.html">PROGRAMMING</a>
</pre><p>

The Common Lisp language allows its <code><a href="PAIRLIS.html">pairlis</a></code> function to construct
an alist in any order!  So we have to define our own version,
<code>pairlis$</code>.  It returns the list of pairs obtained by <code><a href="CONS.html">cons</a></code>ing
together successive respective members of the given lists until the
first list runs out.  (Hence in particular, if the second argument
is <code>nil</code> then each element of the first argument is paired with <code>nil</code>.)
<p>
The <a href="GUARD.html">guard</a> for <code>pairlis$</code> requires that its arguments are true lists.
<br><br><br><a href="acl2-doc.html"><img src="llogo.gif"></a> <a href="acl2-doc-index.html"><img src="index.gif"></a>
</body>
</html>