Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
Term rewriting and all that
A Filter Model for Concurrent $\lambda$-Calculus
SIAM Journal on Computing
Domains and lambda-calculi
MetaML and multi-stage programming with explicit annotations
Theoretical Computer Science - Partial evaluation and semantics-based program manipulation
Computer-Aided Reasoning: An Approach
Computer-Aided Reasoning: An Approach
Template meta-programming for Haskell
Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Revised Report on the Algorithmic Language Scheme
Higher-Order and Symbolic Computation
Strong Normalization in a Non-Deterministic Typed Lambda-Calculus
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Commutation, Transformation, and Termination
Proceedings of the 8th International Conference on Automated Deduction
A multi-stage language with intensional analysis
Proceedings of the 5th international conference on Generative programming and component engineering
Formalization of the DE2 language
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
| Hi-index | 0.00 |
reFLect is a new functional language, developed at Intel for use in hardware design and verification. It contains features intended to facilitate the construction, analysis, and manipulation of the language's own programs. It is also intended to be the executable subset of the term language of a theorem prover based on higher order logic.In this paper, we consider core reFLect---a language that extends a polymorphically typed λ-calculus with a datatype for programs and with constructs for splicing programs into programs and for defining functions that inspect and modify programs. We prove that the reduction semantics for this language is strongly normalizing and confluent. We also give a set-theoretical denotational semantics for the language and prove that the reduction semantics is sound with respect to the denotational semantics. These results provide the basis for developing the semantics of reFLect's extension of higher order logic and proving its soundness.