by Mikael Pettersson
Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming, PLILP, volume 884 of LNCS
ftp://ftp.ida.liu.se/pub/labs/pelab/papers/plilp94rml.ps.gz
Add To MetaCart
Abstract:
RML is a programming language intended for the implementation of Natural Semantics specifications. The basic procedural elements are relations: many-to-many mappings defined by a number of axioms or inference rules. It has control flow, logical variables and (explicit) unification as in Prolog; from ML it borrows a polymorphic type system, data structures, and pattern matching; a facility for separatelycompilable modules also exists. A simple prototype compiler, based on translating RML to Continuation-Passing Style and then to C, has been implemented. Benchmarks indicate that this compiler generates code that is several orders of magnitude faster than Typol, and two times faster than standard Prolog compilers.
Citations
|
1463
|
The Definition of Standard ML
– Milner, Tofte, et al.
- 1990
|
|
1064
|
A Structural Approach to Operational Semantics
– Plotkin
- 1981
|
|
588
|
Compiling with Continuations
– Appel
- 1992
|
|
448
|
An abstract Prolog instruction set
– Warren
|
|
261
|
Natural semantics
– Kahn
- 1987
|
|
205
|
Orbit: An optimizing compiler for Scheme
– Kranz, Kelsey, et al.
- 1986
|
|
192
|
Warren’s Abstract Machine: A Tutorial Reconstruction
– Ait-Kaci
- 1991
|
|
112
|
closure-passing style
– Appel, Jim, et al.
- 1989
|
|
97
|
Can Logic Programming Execute as Fast as Imperative Programming
– Roy
- 1990
|
|
92
|
Rabbit: A compiler for Scheme
– Jr
- 1978
|
|
84
|
Is there a use for linear logic
– Wadler
- 1991
|
|
71
|
Realistic compilation by program transformation
– Kelsey, Hudak
- 1989
|
|
70
|
For a better support of static data flow
– Consel, Danvy
|
|
56
|
Detecting global variables in denotational specifications
– Schmidt
- 1985
|
|
44
|
Proof of Translation in Natural Semantics
– Despeyroux
- 1986
|
|
21
|
A denotational semantics for Prolog
– Nicholson, Foo
- 1989
|
|
10
|
Continuation passing transformation and abstract interpretation
– Filho, Burn
- 1993
|
|
10
|
A term pattern-match compiler inspired by finite automata theory
– Pettersson
- 1992
|
|
9
|
Compiling Typol with Attribute Grammars
– Attali
- 1988
|
|
4
|
Functional Evaluation of Natural Semantics Specifications
– Attali, Chazarain
- 1990
|
|
2
|
The Definition of RML -- Version 1. Forthcoming research report
– Pettersson
- 1995
|
|
2
|
Anurag Acharya. No assembly required
– Tarditi, Lee
- 1992
|
|
1
|
Should Not CONS Its Arguments, Part II: Cheney on the M.T.A. Draft posted to the comp.lang.scheme.c newsgroup, February 4
– CONS
- 1994
|
