John Maraist, Frank S. K. Silbermann  Home/Search
Context
Related
| unisa.edu.au/~cisjpm/Pa...PLILP94.ps.gz 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: unisa.edu.au/~cisjpm/Papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a system for the efficient implementation via graph reduction of functional-logic programming languages. In contrast to existing systems, ours allows sharing not only of fully common subexpressions but also of partially common expressions formed across narrowings, and allows both lazy and eager evaluation semantics. This sharing across narrowings is achieved by adapting a technique described by Lamping for optimal reduction of lambda terms. Implementations of functional-logic... (Update)
Similar documents (at the sentence level):
10.2%: A Graph Reduction Technique and an Extension to the G-Machine for .. - Maraist (1994) (Correct)
Active bibliography (related documents): More All
0.2: Solving Higher-Order Equations: From Logic to Programming - Prehofer (1995) (Correct)
0.1: Yet another way of Set-processing: The Escher style and its.. - Eder (1999) (Correct)
0.1: Implementation Issues for Functional Logic Programming - Kuchen (Correct)
Similar documents based on text: More All
0.2: Call-by-Name, Call-by-Value, Call-by-Need, and the Linear.. - Maraist, Odersky, al. (1995) (Correct)
0.1: A Parallel Implementation of Equational Programming - Dershowitz, Lindenstrauss (1990) (Correct)
0.1: Comparing the Galois Connection and Widening/Narrowing.. - Cousot, Cousot (1992) (Correct)
BibTeX entry: (Update)
@inproceedings{ maraist94graph,
author = "John Maraist and Frank S. K. Silbermann",
title = "A Graph Reduction Technique with Sharing across Narrowings for Functional-Logic Languages",
booktitle = "Proc. {PLILP} '94, 6'th Symposium on Programming Language Implementation and Logic Programming, Madrid, Spain",
year = "1994",
editor = "Manuel Hermenegildo and Jaan Penjam",
pages = "355-369",
publisher = "Springer-Verlag, Lecture Notes in Computer Science 844",
month = "September",
url = "citeseer.ist.psu.edu/article/maraist94graph.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1981
254 The integration of functions into logic programming: From th.. (context) - Hanus
138 The revised report on the syntactic theories of sequential c.. - Felleisen, Hieb - 1989
109 The Implementation of Functional Programming Languages (context) - Jones - 1987
78 A demand driven computation strategy for lazy narrowing - Loogen, Fraguas et al. - 1993
24 An algorithm for optimal lambda calculus reduction (context) - Lamping - 1990
18 Unification of functional and logic languages (context) - Darlington, Field et al. - 1986
16 Semantics and Pragmatics of the Lambda Calculus (context) - Wadsworth - 1971
7 A domain-theoretic approach to functional and logic programm.. (context) - Silbermann, Jayaraman - 1992
6 sharing and non-determinism in resolution based functional l.. (context) - Liu, evaluation - 1993
2 An abstract machine for compiling set-based functional logic.. (context) - Maraist - 1993
2 Logic Languages Based on Functions: Semantics and Implementa.. (context) - Reddy - 1986
Documents on the same site (http://www.cis.unisa.edu.au/~cisjpm/Papers/): More
The Call-by-Need Lambda Calculus - Maraist, Odersky (1994) (Correct)
Call-by-Name, Call-by-Value, Call-by-Need, and the.. - Maraist, Odersky.. (1998) (Correct)
Call-by-Need Splits the Mode! - Maraist (1993) (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