53 search results - page 7 / 11 » Computationally Sound Mechanized Proofs of Correspondence As... |
JFPLC
2000
14 years 11 months ago
2000
ABSTRACT. This paper focuses on the assignment of meaning to some nonterminating SLD derivations in logic programming. Several approaches have been developped by considering infini...
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fr...
106
click to vote
TLCA
1997
Springer
15 years 2 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
CONCUR
2003
Springer
15 years 3 months ago
2003
Springer
traction for HOPLA Mikkel Nygaard1 and Glynn Winskel2 1 BRICS , University of Aarhus 2 Computer Laboratory, University of Cambridge A fully abstract denotational semantics for the ...
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
—We design an intuitionistic predicate logic that supports a limited amount of classical reasoning, just enough to prove a variant of Markov’s principle suited for predicate lo...