Sciweavers

184 search results - page 7 / 37
» Arity Raiser and its Use in Program Specialization
Sort
View
ICFP
2002
ACM
14 years 7 months ago
Composing monads using coproducts
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
Christoph Lüth, Neil Ghani
LISP
1998
57views more  LISP 1998»
13 years 7 months ago
A Generalization of Jumps and Labels
This paper describes a new language feature that is a hybrid of labels and procedures. It is closely related to jumping out of a functional subroutine, and includes conventional la...
Peter J. Landin
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 8 months ago
Verification of Java Bytecode using Analysis and Transformation of Logic Programs
State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including terminat...
Elvira Albert, Miguel Gómez-Zamalloa, Laure...
ERSHOV
2009
Springer
14 years 2 months ago
Symbolic Bounded Conformance Checking of Model Programs
Abstract. Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of ...
Margus Veanes, Nikolaj Bjørner
PEPM
2007
ACM
14 years 2 months ago
Quasi-terminating logic programs for ensuring the termination of partial evaluation
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
Germán Vidal