136 search results - page 15 / 28 » Typed Logical Variables in Haskell |
JOLLI
2007
13 years 8 months ago
2007
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is i...
ICFP
2005
ACM
14 years 8 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
AISC
2008
Springer
13 years 10 months ago
2008
Springer
We use higher-order logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials o...
TACS
2001
Springer
14 years 1 months ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
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...