Sciweavers

133 search results - page 8 / 27
» Benchmarking Implementations of Lazy Functional Languages
Sort
View
WLP
2007
Springer
15 years 10 months ago
The Kiel Curry System KiCS
This paper presents the Kiel Curry System (KiCS) for the lazy functional logic language Curry. Its main features beyond other Curry implementations are: flexible search control by...
Bernd Brassel, Frank Huch
PPDP
2001
Springer
15 years 8 months ago
Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
Franklyn A. Turbak, J. B. Wells
CAV
2007
Springer
164views Hardware» more  CAV 2007»
15 years 7 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
LCPC
1999
Springer
15 years 8 months ago
An Empirical Study of Function Pointers Using SPEC Benchmarks
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
Ben-Chung Cheng, Wen-mei W. Hwu
CORR
2006
Springer
135views Education» more  CORR 2006»
15 years 3 months ago
Constraint Functional Logic Programming over Finite Domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...
Antonio J. Fernández, Maria Teresa Hortal&a...