The Theory of Fexprs is Trivial

Authors:
Mitchell Wand
Affiliations:
College of Computer Science, Northeastern University, 360 Huntington Avenue, 161CN, Boston, MA 02115, USA. E-mail: wand@ccs.neu.edu
Venue:
Lisp and Symbolic Computation
Year:
1998

Citing 10
Cited 10

Intensions and extensions in a reflective tower

LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
M-LISP: a representation-independent dialect of LISP with reduction semantics

ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying the correctness of binding-time analysis

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A semantics of introspection in a reflective prototype-based language

Lisp and Symbolic Computation - Special issue on computational reflection
A simple reflective interpreter

Lisp and Symbolic Computation - Special issue on computational reflection
A theory of primitive objects: untyped and first-order systems

Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
Reflection and semantics in LISP

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A semantic comparison of LISP and SCHEME

LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Theoretical aspects of reflection in programming languages

Theoretical aspects of reflection in programming languages
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual

A sound reduction semantics for untyped CBN mutli-stage computation. Or, the theory of MetaML is non-trival (extended abstract)

PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Macros as multi-stage computations: type-safe, generative, binding macros in MacroML

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Environment classifiers

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Generic Reification Technique for Object-Oriented Reflective Languages

Higher-Order and Symbolic Computation
Tag Elimination and Jones-Optimality

PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Leveraging .NET meta-programming components from F#: integrated queries and interoperable heterogeneous execution

Proceedings of the 2006 workshop on ML
Debugging macros

GPCE '07 Proceedings of the 6th international conference on Generative programming and component engineering
Language support for processing distributed ad hoc data

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Directly reflective meta-programming

Higher-Order and Symbolic Computation
Debugging hygienic macros

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a very simple model of a reflective facility based onthe pure λ-calculus, and we show that its theory of contextual equivalenceis trivial: two terms in the language are contextually equivalent iff theyare α-congruent.