From syntactic theories to interpreters: Automating the proof of unique decomposition

Higher-Order and Symbolic Computation

Volumn 14, Issue 4, 2001, Pages 387-409

  Xiao, Yong ^a   Sabry, Amr ^b   Ariola, Zena M ^a  

^a UNIVERSITY OF OREGON   (United States)

^b INDIANA UNIVERSITY   (United States)

Author keywords

Finite tree automata; Interpreters; Proof automation; Regular tree grammars; Syntactic theories

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; CONTEXT FREE GRAMMARS; FINITE AUTOMATA; OPTIMIZATION; PROGRAM INTERPRETERS; SEMANTICS; THEOREM PROVING;

REGULAR TREE GRAMMARS;

SYNTACTICS;

EID: 0035728958     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1014408032446     Document Type: Article

References (16)

1. The call-by-need lambda calculus
2. The lambda calculus: Its syntax and semantics
3. The mathematical language AUTOMATH, its usage, and some of its extensions
4. The Coq proof assistant user's guide
5. Statically checkable pattern abstractions
6. Putting operational techniques to the test: A syntactic theory for behavioral Verilog
7. Monadic state: Axiomatization and type safety
8. Computing with contexts
9. System description: Twelf - A metalogical framework for deductive systems
10. Monadic encapsulation in ML
11. From syntactic theories to interpreters: A specification language and its compiler