A Complex Java Code Generator for ACL2 Based on a Shallow Embedding of ACL2 in Java

Abstract

This paper describes a code generator that translates ACL2 constructs to corresponding Java constructs, according to a shallow embedding of ACL2 in Java. Starting from purely functional ACL2 code, the generated Java code exhibits imperative and object-oriented features like destructive updates, loops, and overloading. The overall translation from ACL2 to Java is fairly elaborate, consisting of several ACL2-to-ACL2 pre-translation steps, an ACL2-to-Java proper translation step, and several Java-to-Java post-translation steps. Experiments suggest that the generated Java code is not much slower than the ACL2 code. The code generator can also recognize, and translate to Java, ACL2 representations of certain Java constructs, forerunning a code generation approach based on a shallow embedding of Java in ACL2 (i.e. going the other way). This code generator builds upon, and significantly extends, a simple Java code generator for ACL2 based on a deep embedding of ACL2 in Java.

A Proof-Generating C Code Generator for ACL2 Based on a Shallow Embedding of C in ACL2

“…The model has versions of the integer operations for all possible combinations of operand types, whose definitions capture those rules. There are thousands of such functions, 4 generated via macros that exploit their available uniformity.…”

“…ATJ [3,4] [22, java::atj] is a Java code generator for ACL2 primarily based on direct deep embedding and direct shallow embedding. It also features partial support for inverse shallow embedding, which was in fact pioneered in ATJ, and then developed in full in ATC.…”

“…However, some applications require code in other languages, such as C for embedded systems or device drivers. To synthesize this kind of code via an APT derivation, a code generator for ACL2 can be used, such as ATJ [3,4] [22, java::atj] (for Java).…”

“…(4 unary operations × 10 types) + (16 binary operations × 100 type combinations) = 1,640 functions 5. (2 read or write operations) × (10 array types) × (10 index types) = 200 functions.…”