2956 search results - page 17 / 592 » Databases and Higher Types |
ITP
2010
15 years 5 months ago
2010
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based first-order relational model finder. Nitpick supports unbounded quantification, (co)ind...
107
click to vote
FSTTCS
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We describe a denotational (game) semantics for a call-byvalue functional language with multiple threads of control, which may communicate values of general type on local...
125
Voted
CADE
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
JAR
2008
15 years 1 months ago
2008
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...
126
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...