551 search results - page 29 / 111 » Natural proofs |
JFPLC
2004
13 years 10 months ago
2004
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
EACL
1989
ACL Anthology
13 years 10 months ago
1989
ACL Anthology
It is a tacit assumption of much linguisticinquiry that alldistinctderivations of a string should assign distinct meanings. But despite the tidinessof such derivational uniqueness...
ICGI
2010
Springer
13 years 9 months ago
2010
Springer
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
HASKELL
2005
ACM
14 years 2 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...