60 search results - page 4 / 12 » Proof Terms for Simply Typed Higher Order Logic |
KI
1990
Springer
14 years 25 days ago
1990
Springer
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
CADE
2003
Springer
14 years 9 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
TPHOL
1998
IEEE
14 years 1 months ago
1998
IEEE
Abstraction in a Higher-Order Logic Framework Marco Benini Sara Kalvala Dirk Nowotka Department of Computer Science University of Warwick, Coventry, CV4 7AL, United Kingdom We pres...
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 ...
RTA
2010
Springer
14 years 20 days ago
2010
Springer
We show that, contrary to the situation in first-order term rewriting, almost none of the usual properties of rewriting are modular for higher-order rewriting, irrespective of the...