5608 search results - page 166 / 1122 » On the Theory of Matchgate Computations |
106
click to vote
LICS
2007
IEEE
15 years 8 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
140
click to vote
PLPV
2009
ACM
15 years 10 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
135
Voted
ICLP
1995
Springer
15 years 5 months ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
116
Voted
DAC
2006
ACM
16 years 2 months ago
2006
ACM
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
112
click to vote
ICFP
2002
ACM
16 years 1 months ago
2002
ACM
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...