(Enter summary)
Abstract: We describe a software tool for specifying operational semantics as a
term-graph reduction system. The semantics are guaranteed to accurately model
the asymptotic space and time usage of an implementation yet are abstract enough
to support reasoning at the program level. (Update)
Context of citations to this paper: More
...in this paper. Our term graph framework enables operational semantics to be written which directly and fairly model space and time usage [4]. We are also using it to define a spacesemantics for Core Haskell which is close to h , though less similar to [23] Gustavsson and...
Cited by: More
A Model for Comparing the Space Usage of Lazy Evaluators - Bakewell, Runciman (2000)
(Correct)
Similar documents (at the sentence level):
25.7%: The Space Usage Problem: An Evaluation Kit for.. - Bakewell, Runciman (2000)
(Correct)
Active bibliography (related documents): More All
0.7: Possibilities and Limitations of Call-by-Need Space Improvement - Gustavsson, Sands (2001)
(Correct)
0.4: A New Criterion for Safe Program Transformations - Minamide (2000)
(Correct)
0.4: Runtime Behavior of Conversion Interpretation of Subtyping - Minamide
(Correct)
Similar documents based on text: More All
0.1: Demo Kit - Getting Started With
(Correct)
0.0: Inequational Deduction as Term Graph Rewriting - Corradini, Gadducci, Kahl, König
(Correct)
0.0: Compact Trace Generation and Power Measurement in Software.. - Fabian Wolf Judita (2000)
(Correct)
BibTeX entry: (Update)
A. Bakewell and C. Runciman. The space usage problem: An evaluation kit for graph-reduction semantics. In Draft Proc. 2nd Scottish Functional Programming Workshop, School of Computer Science, University of St. Andrews, July 2000. http://citeseer.ist.psu.edu/article/bakewell00space.html More
@misc{ bakewell00space,
author = "A. Bakewell and C. Runciman",
title = "The space usage problem: An evaluation kit for graph-reduction semantics",
text = "A. Bakewell and C. Runciman. The space usage problem: An evaluation kit
for graph-reduction semantics. In Draft Proc. 2nd Scottish Functional Programming
Workshop, School of Computer Science, University of St. Andrews, July 2000.",
year = "2000",
url = "citeseer.ist.psu.edu/article/bakewell00space.html" }
Citations (may not include all citations):
111
Handbook of Graph Grammars and Computing by Graph Transforma.. (context) - Ehrig, Engels et al. - 1999
49
Equational term graph rewriting
- Ariola, Klop - 1996
21
Models of Sharing Graphs: A Categorical Semantics of let and.. (context) - Hasegawa - 1997
21
Operational Reduction Models for Functional Programming Lang..
- Rose - 1996
16
Properties of a first-order functional language with sharing
- Ariola - 1995
12
Proper tail recursion and space efficiency
- Clinger - 1998
5
A model for comparing the space usage of lazy evaluators
- Bakewell, Runciman - 2000
5
Space-profiling semantics of the call-by-value lambda calcul..
- Minamide - 1999
5
Chalmers University of Technology (context) - Pareto, Master's et al. - 1998
2
A space semantics for core Haskell
- Bakewell, Runciman - 2000
2
A provably time and space efficient implementation of NESL (context) - Blelloch, Greiner - 1996
Documents on the same site (http://www.dcs.ed.ac.uk/home/stg/sfpw/book/): More
Chapter 11 - Camlflow Caml To
(Correct)
Chapter 14 - Detecting Common Elements (2000)
(Correct)
Parallel Heuristic Search in Haskell - Cope, Gent, Hammond
(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