Robert Muller  Home/Search
Context
Related
| bc.edu/~muller/postscript...pepm91.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: bc.edu/~muller/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The LISP evaluator is a virtual machine analog of the stored-program computer on which it executes -- it has universal power and dynamically constructed representations of programs can be converted by the eval operator into executable programs. In this paper we study the natural operational semantics and equational logic of a dialect of pure LISP and an extension which includes the eval operator and fexprs (i.e., non-strict functions whose arguments are passed by-representation). We begin by... (Update)
Similar documents (at the sentence level):
24.7%: M-LISP: A Representation-Independent Dialect of LISP with.. - Muller (1992) (Correct)
Active bibliography (related documents): More All
0.7: A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005) (Correct)
0.6: Amalgams: Names and Name Capture in a Declarative Framework - Michel, Giavitto (1998) (Correct)
0.3: A Staging Calculus and its Application to the Verification of.. - Muller (1993) (Correct)
Similar documents based on text: More All
0.1: The Theory of Fexprs is Trivial - Wand (1998) (Correct)
0.1: Precedences for Conctypes - Aasa (1993) (Correct)
0.1: Duplication and Partial Evaluation to Implement Reflective.. - Asai (1993) (Correct)
BibTeX entry: (Update)
@inproceedings{ muller91mlisp,
author = "Robert Muller",
title = "M-{LISP}: Its Natural Semantics and Equational Logic (Extended Abstract)",
booktitle = "Partial Evaluation and Semantic-Based Program Manipulation",
pages = "234-242",
year = "1991",
url = "citeseer.ist.psu.edu/muller91mlisp.html" }
Citations (may not include all citations):906 A structural approach to operational semantics - Plotkin - 1981
273 Can programming be liberated from the von Neumann style (context) - Backus - 1978
139 Recursive functions of symbolic expressions and their comput.. - McCarthy - 1960
43 Tree manipulation systems and Church-Rosser theorems (context) - Rosen - 1973
34 Reasoning with continuations (context) - Felleisen, Friedman et al. - 1986
22 LEAP: A language with eval and polymorphism (context) - Pfenning, Lee - 1988
19 LISP: A representation independent dialect of LISP with redu.. (context) - Muller, in - 1990
19 Proving theorems about LISP functions - Boyer, Moore - 1975
17 Macro-byexample: Deriving syntactic transformations from the.. (context) - Kohlbecker, Wand - 1987
17 call-by-value and the -calculus (context) - Plotkin - 1975
17 Axiomatizing operational equivalence in the presence of side.. - Mason, Talcott - 1989
14 Special forms in LISP (context) - Pitman - 1980
13 Unique normal forms for lambda calculus with surjective pair.. (context) - Klop, de Vrijer - 1989
11 A semantic comparison of LISP and Scheme (context) - Muchnick, Pleban - 1980
8 Re ection and Semantics in a Procedural Language (context) - Smith - 1982
6 Re ection and semantics in LISP (context) - Smith - 1984
6 The theory and practice of rst class prompts (context) - Felleisen - 1988
3 The mystery of the tower revealed: A non-re ective descripti.. (context) - Friedman, Wand - 1986
3 North Holland Press (context) - Barendregt, Calculus et al. - 1984
3 Reication without evaluation (context) - Bawden - 1988
3 The implementation of procedurally re ective languages (context) - Rivi, Smith - 1984
2 Equivalence of rst order LISP programs: proving properties o.. (context) - Mason - 1986
2 Recognizing quote deemed harmful to eval's laziness (context) - Adams - 1987
2 User dened data types as an aid to verifying lisp programs (context) - Cartwright - 1976
2 A list oriented extension of the Church-Rosser theorem (context) - Revesz - 1988
2 A critique of Abelson and Sussman or why calculating is bett.. (context) - Wadler - 1987
2 Reication: Re- ection without metaphysics (context) - Friedman, Wand - 1984
2 Technical Report AIM (context) - Gordon, denotational - 1975
2 Intensions and extensions in a re ective tower (context) - Danvy, Malmkjaer - 1988
1 Programer's Manual (context) - McCarthy - 1962
1 MetaLISP: A Representation Independent Dialect of LISP with .. (context) - Muller - 1989
Documents on the same site (http://oak.bc.edu/~muller/papers.html): More
Compiling with Polymorphic and Polyvariant Flow Types - Turbak, Dimock, Muller, Wells (1997) (Correct)
Domain Theory for Nonmonotonic Functions - Zhou, Muller (1990) (Correct)
Strongly Typed Flow-Directed Representation.. - Dimock, Muller.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC