1017 search results - page 46 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
ENTCS
2007
14 years 9 months ago
2007
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
ICFP
2003
ACM
15 years 9 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
TPHOL
2003
IEEE
15 years 2 months ago
2003
IEEE
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
NMR
2004
Springer
15 years 3 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
INFORMATICALT
2000
14 years 9 months ago
2000
The paper presents a simple programming language and rewriting system called GENS. It is based on an extension of the -calculus called E-calculus. GENS is a multiparadigm language:...