9 search results - page 1 / 2 » Interleaving Universal Principles and Relational Constraints... |
ACL
1997
13 years 6 months ago
1997
We introduce a typed feature logic system providing both universal implicational principles as well as definite clauses over feature terms. We show that such an architecture suppo...
TLDI
2009
ACM
14 years 1 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
CORR
2006
Springer
13 years 4 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...
ISSTA
2004
ACM
13 years 10 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
LOGCOM
2010
13 years 3 months ago
2010
A theory of infinitary deduction systems is developed for the modal logic of coalgebras for measurable polynomial functors on the category of measurable spaces. These functors ha...