3481 search results - page 100 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
POPL
2004
ACM
14 years 9 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
PPDP
2010
Springer
13 years 7 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
RISE
2004
Springer
14 years 2 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
FMCO
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. A temporal logic is proposed as a tool for specifying properties of Klaim programs. Klaim is an experimental programming language that supports a programming paradigm whe...
PLILP
1994
Springer
14 years 1 months ago
1994
Springer
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...