Sciweavers

1264 search results - page 5 / 253
» Abstract machines for programming language implementation
Sort
View
ESOP
1992
Springer
15 years 10 months ago
A Provably Correct Compiler Generator
We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated comp...
Jens Palsberg
ECOOPWEXCEPTION
2000
Springer
15 years 10 months ago
Portable Implementation of Continuation Operators in Imperative Languages by Exception Handling
Abstract. This paper describes a scheme of manipulating (partial) continuations in imperative languages such as Java and C++ in a portable manner, where the portability means that ...
Tatsurou Sekiguchi, Takahiro Sakamoto, Akinori Yon...
ICFP
2002
ACM
16 years 5 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
SCP
1998
113views more  SCP 1998»
15 years 5 months ago
Linear-Time Hierarchies for a Functional Language Machine Model
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well a...
Eva Rose