Sciweavers

38 search results - page 6 / 8
» lisp 2006
Sort
View
JUCS
2010
107views more  JUCS 2010»
13 years 4 months ago
Systematic Unit Testing in a Read-eval-print Loop
: Lisp programmers constantly carry out experiments in a read-eval-print loop. The experimental activities convince the Lisp programmers that new or modified pieces of programs wo...
Kurt Nørmark
LISP
2006
105views more  LISP 2006»
13 years 6 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
LISP
2006
160views more  LISP 2006»
13 years 6 months ago
Formal compiler construction in a logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present a new approach based on the igher-order abstract syntax and ...
Jason Hickey, Aleksey Nogin
LISP
2006
77views more  LISP 2006»
13 years 6 months ago
Expressing combinatory reduction systems derivations in the rewriting calculus
The last few years have seen the development of the rewriting calculus (also called rho-calculus or -calculus) that uniformly integrates first-order term rewriting and the -calculu...
Clara Bertolissi, Horatiu Cirstea, Claude Kirchner
JMLR
2006
78views more  JMLR 2006»
13 years 6 months ago
Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach
We describe an approach to the inductive synthesis of recursive equations from input/outputexamples which is based on the classical two-step approach to induction of functional Li...
Emanuel Kitzelmann, Ute Schmid