The Theory of Fexprs is Trivial (1998)

Cached

Download Links

by Mitchell Wand
Citations:19 - 0 self

Documents Related by Co-Citation

239 MetaML and Multi-Stage Programming with Explicit Annotations – Walid Taha, Tim Sheard - 1999
38 On abstraction and the expressive power of programming languages – J C Mitchell - 1993
149 Hygienic macro expansion – Eugene E Kohlbecker, Daniel P Friedman, Matthias Felleisen, Bruce F Duba - 1986
32 An Idealized MetaML: Simpler, and More Expressive – Eugenio Moggi, Walid Taha, Zine El-abidine Benaissa, Tim Sheard - 1999
23 Efficient Self-Interpretation in Lambda Calculus – Torben Æ. Mogensen, Torben Ae. Mogensen - 1994
302 Higher-order abstract syntax – F Pfenning, C Elliott - 1988
730 Notions of Computation and Monads – Eugenio Moggi - 1991
33 Challenging problems in partial evaluation and mixed computation – Neil D Jones - 1988
21 Fast Binding-Time Analysis for Multi-Level Specialization – Robert Glück, Jesper Jørgensen - 1996
11 Graduate Institute Technical Reports. P.O. Box 91000 – Oregon - 1999
28 An Automatic Program Generator for Multi-Level Specialization – Robert Glück, Jesper Jørgensen - 1997
22 Logical Modalities and Multi-Stage Programming – Zine El-abidine Benaissa, Eugenio Moggi, Walid Taha, Tim Sheard - 1999
185 A Modal Analysis of Staged Computation – Rowan Davies, Frank Pfenning - 1996
93 A Partial Evaluator for the Untyped Lambda Calculus – Carsten K. Gomard, Neil D. Jones - 1991
80 A temporal-logic approach to binding-time analysis – Rowan Davies - 1996
5 The Correctness of Type Specialisation – John Hughes - 1999
18 A simple solution to type specialization – Olivier Danvy - 1998
27 A Language with Eval and Polymorphism – Frank Pfenning, Peter Lee - 1989
10 A sound reduction semantics for untyped CBN mutli-stage computation. Or, the theory of MetaML is non-trivial – Walid Taha - 2000