1941 search results - page 142 / 389 » Reasoning about Computations Using Two-Levels of Logic |
125
click to vote
ESOP
2012
Springer
13 years 11 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
146
click to vote
TPHOL
2000
IEEE
15 years 7 months ago
2000
IEEE
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose metalanguage to implement both general-purpose reasonin...
144
click to vote
TLDI
2009
ACM
16 years 10 days ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
131
click to vote
TPHOL
1998
IEEE
15 years 7 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...
126
Voted
AAAI
2007
15 years 5 months ago
2007
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...