Sciweavers

89 search results - page 10 / 18
» A Program Inverter for a Functional Language with Equality a...
Sort
View
APLAS
2007
ACM
13 years 11 months ago
Finally Tagless, Partially Evaluated
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
Jacques Carette, Oleg Kiselyov, Chung-chieh Shan
PPDP
2010
Springer
13 years 5 months ago
Functional derivation of a virtual machine for delimited continuations
This paper connects the definitional interpreter for the λ-calculus extended with delimited continuation constructs, shift and reset, with a compiler and a low-level virtual mac...
Kenichi Asai, Arisa Kitani
IFL
2001
Springer
137views Formal Methods» more  IFL 2001»
13 years 12 months ago
A Generic Programming Extension for Clean
Abstract. Generic programming enables the programmer to define functions by induction on the structure of types. Defined once, such a generic function can be used to generate a s...
Artem Alimarine, Marinus J. Plasmeijer
JAR
2008
89views more  JAR 2008»
13 years 7 months ago
An Extensible Encoding of Object-oriented Data Models in hol
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
Achim D. Brucker, Burkhart Wolff
PEPM
2011
ACM
12 years 10 months ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura