File: logic.lisp

package info (click to toggle)
acl2 8.6%2Bdfsg-3
  • links: PTS
  • area: main
  • in suites: forky, sid
  • size: 1,138,276 kB
  • sloc: lisp: 17,818,294; java: 125,359; python: 28,122; javascript: 23,458; cpp: 18,851; ansic: 11,569; perl: 7,678; xml: 5,591; sh: 3,978; makefile: 3,840; ruby: 2,633; yacc: 1,126; ml: 763; awk: 295; csh: 233; lex: 197; php: 178; tcl: 49; asm: 23; haskell: 17
file content (36 lines) | stat: -rw-r--r-- 919 bytes parent folder | download | duplicates (2) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
 
; Copyright (C) 2024, Matt Kaufmann
; Written by Matt Kaufmann
; License: A 3-clause BSD license.  See the LICENSE file distributed with ACL2.

; See README.txt for an overview of this example.

; This book provides support for the :LOGIC functions of the abstract stobj,
; mem, introduced in mem.lisp.

(in-package "ACL2")

(defconst *mem-len* 1000) ; 1000 is rather arbitrary.

(defun mem$ap (x)
  (declare (xargs :guard t))
  (and (true-listp x)
       (= (length x) *mem-len*)))

(defun create-mem$a ()
  (declare (xargs :guard t))
  (make-list *mem-len*))

(defun mem-indexp (n)
  (declare (xargs :guard t))
  (and (natp n)
       (< n *mem-len*)))

(defun lookup$a (n x)
  (declare (xargs :guard (and (mem-indexp n)
                              (mem$ap x))))
  (nth n x))

(defun update$a (n val x)
  (declare (xargs :guard (and (mem-indexp n)
                              (mem$ap x))))
  (update-nth n val x))