Sciweavers

87 search results - page 10 / 18
» Functions and Lazy Evaluation in Prolog
Sort
View
WCFLP
2005
ACM
14 years 2 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
GI
2009
Springer
14 years 1 months ago
Constraint Functional Multicore Programming
: In this paper we present the concurrent constraint functional programming CCFL and an abstract machine for the evaluation of CCFL programs in a multicore environment. The source ...
Petra Hofstedt, Florian Lorenzen
ICLP
1999
Springer
14 years 25 days ago
Algebra of Logic Programming
A declarative programming language has two kinds of semantics. The tract helps in reasoning about speci cations and correctness, while an operational semantics determines the mann...
Silvija Seres, J. Michael Spivey, C. A. R. Hoare
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
14 years 2 months ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol
PADL
2004
Springer
14 years 1 months ago
Observing Functional Logic Computations
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
Bernd Brassel, Olaf Chitil, Michael Hanus, Frank H...