Sciweavers

4355 search results - page 3 / 871
» From Interpretation to Compilation
Sort
View
COLING
1996
13 years 9 months ago
Compiling a Partition-Based Two-Level Formalism
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alterna...
Edmund Grimley-Evans, George Anton Kiraz, Stephen ...
CC
2009
Springer
142views System Software» more  CC 2009»
14 years 8 months ago
Extensible Proof-Producing Compilation
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...
Magnus O. Myreen, Konrad Slind, Michael J. C. Gord...
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
14 years 27 days ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
SAIG
2000
Springer
13 years 11 months ago
Compiling Embedded Languages
Abstract. Functional languages are particularly well-suited to the implementation of interpreters for domain-specific embedded languages (DSELs). We describe an implemented techniq...
Conal Elliott, Sigbjorn Finne, Oege de Moor
ICFP
2002
ACM
14 years 7 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy