12 search results - page 1 / 3 » Functional Plus Logic Programming with Built-In and Symbolic... |
PPDP
1999
Springer
13 years 9 months ago
1999
Springer
PPDP
2010
Springer
13 years 2 months ago
2010
Springer
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
COOPIS
2004
IEEE
13 years 8 months ago
2004
IEEE
In this paper we present an implementation of a constraint solving module, CLP(Flex), for dealing with unification in an equality theory for terms with flexible arity function symb...
PADL
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
IFIP
2001
Springer
13 years 9 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...