Neil D. Jones  Home/Search
Context Related
| diku.dk/diku/semantics/pape...D75.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: diku.dk/topps/bibliography...1991 (more) Homepages: N.Jones |
Rate this article:      (best)Comment on this article |
Abstract: A symbolic version of an operation on values is a corresponding operation on program texts. For example, symbolic composition of two programs p, q yields a program whose meaning is the (mathematical) composition of the meanings of p and q. Another example is symbolic specialization of a function to a known first argument value. This operation, given the first argument, transforms a two-input program into an equivalent one-input program. Computability of both of these symbolic operations has... (Update)
Context of citations to this paper: More
...successor stages, and sharing of code across multiple stages. Such extensions are normally considered external issues. For example, Jones [Jon91] describes a typed framework for such concepts, but only at the level of operations on whole programs. Our framework instead...
...stages, and sharing of code across multiple stages. Such extensions are normally considered external issues. For example, Jones [Jon91] describes a typed framework for such concepts, but only at the level of operations on whole programs. Our framework instead provides...
Cited by: More
A Modal Analysis of Staged Computation - Rowan Davies And (1996) (Correct)
Active bibliography (related documents): More All
0.9: Experiments with Implementations of two Theoretical - Amtoft (Correct)
0.5: Online Partial Evaluation for Shift and Reset - Asai (2002) (Correct)
0.5: Constant Time Factors Do Matter (Extended Abstract) - Jones (Correct)
Similar documents based on text: More All
0.3: The Expressive Power of Higher-order Types or, Life without CONS - Jones (Correct)
0.2: logspace and ptime Characterized by Programming - Languages Neil Jones (1999) (Correct)
0.2: ESSLLI 2000 Lecture Notes: Computability and Complexity - From Programming Perspective (2000) (Correct)
Related documents from co-citation: More All
4: A partial evaluator for the untyped lambdacalculus - Gomard, Jones - 1991
4: Intuitionistic necessity revisited - Bierman, de Paiva - 1996
4: Computational lambda-calculus and monads - Moggi - 1989
BibTeX entry: (Update)
Neil D. Jones. Efficient algebraic operations on programs. In T. Rus, editor, AMAST Preliminary Proceedings, University of Iowa, April 1991. A version appears as a chapter in [JGS93]. http://citeseer.ist.psu.edu/jones91efficient.html More
@inproceedings{ jones91efficient,
author = "N. D. Jones",
title = "Efficient Algebraic Operations on Programs",
booktitle = "{AMAST}: Algebraic Methodology and Software Technology",
address = "University of Iowa, USA",
pages = "245--267",
year = "1991",
url = "citeseer.ist.psu.edu/jones91efficient.html" }
Citations (may not include all citations):70 ACM Transactions on Programming Languages and Systems (context) - Turchin, of et al. - 1986
70 ACM Transactions on Programming Languages and Systems (context) - Turchin, of et al. - 1986
51 Allyn and Bacon (context) - Schmidt, Semantics et al. - 1986
7 Theoretical Computer Science (context) - Ershov, Computation et al. - 1982
6 Wagner: An initial Algebra approach to the specification (context) - Goguen, Thatcher - 1978
6 McGraw-Hill (context) - Rogers, Recursive et al. - 1967
4 Compiler generators - What they can do (context) - Mads - 1990
3 ndergaard: MIX: A Self-applicable Partial Evaluator for Expe.. (context) - Jones, Sestoft et al. - 1989
3 North-Holland (context) - Kleene, Metamathematics - 1952
3 ACM Symposium on LISP and Functional Programming (context) - Wadler, Better et al. - 1984
2 Danvy: Automatic autoprojection of recursive equations with .. (context) - Bondorf - 1991
1 Wagner: More on advice on structuring compilers and proving .. (context) - Goguen, Thatcher - 1980
1 Mogensen: A Self-applicable Partial Evaluator for the Lambda.. (context) - Jones, Gomard et al. - 1990
1 Workshop on Partial Evaluation and Mixed Computation (context) - Bjorner, Ershov et al. - 1988
1 ACM Sigplan Symposium on Compiler Construction (context) - Ganzinger, Giegerich et al. - 1984
1 University of Texas Year of Programming Series (context) - Cousineau, abstract et al. - 1990
1 DAIMI Report MD (context) - Mosses, System et al. - 1979
Documents on the same site (http://ftp.diku.dk/topps/bibliography/1991.html): More
Efficient Type Inference for Higher-Order Binding-Time Analysis - Henglein (1991) (Correct)
Analysis and Efficient Implementation of Functional Programs - Sestoft (1991) (Correct)
Experiments with Implementations of two Theoretical - Amtoft (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