3658 search results - page 356 / 732 » The logic of proofs, semantically |
239
click to vote
ICFP
1997
ACM
15 years 11 months ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
199
click to vote
JOLLI
2010
15 years 5 months ago
2010
After a quick overview of the field of study known as “Lexical Semantics”, where we advocate the need of accessing additional information besides syntax and Montaguestyle sema...
188
click to vote
PLDI
2010
ACM
15 years 11 months ago
2010
ACM
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
183
click to vote
FUIN
2008
15 years 7 months ago
2008
This paper presents a cancellation theorem for the preorders in van Glabbeek's linear time-branching time spectrum over BCCSP. Apart from having some intrinsic interest, the p...
155
click to vote
CSL
2002
Springer
15 years 6 months ago
2002
Springer
Ludics has been proposed by Girard as an abstract general approach to proof theory. We explain how its basic notions correspond to those of the "innocent strategy" apprao...