136 search results - page 16 / 28 » Typed Logical Variables in Haskell |
148
Voted
TPHOL
2009
IEEE
15 years 10 months ago
2009
IEEE
ion and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: co...
136
click to vote
JAR
2002
15 years 3 months ago
2002
We formalise natural deduction for first-order logic in the proof assistant Coq, using De Bruijn indices for variable binding. The main judgement we model is of the form d [:] , ...
174
Voted
PLDI
2012
ACM
13 years 5 months ago
2012
ACM
Generic programming (GP) is an increasingly important trend in programming languages. Well-known GP mechanisms, such as type classes and the C++0x concepts proposal, usually combi...
131
click to vote
CSL
2004
Springer
15 years 8 months ago
2004
Springer
Locality notions in logic say that the truth value of a formula can be determined locally, by looking at the isomorphism type of a small neighborhood of its free variables. Such n...
140
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...