3658 search results - page 540 / 732 » The logic of proofs, semantically |
259
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
In 1996, Gil and Lorenz proposed programming language constructs for specifying environmental acquisition in addition to inheritance acquisition for objects. They noticed that in ...
157
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
166
click to vote
CSL
2007
Springer
16 years 21 days ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
145
click to vote
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
193
click to vote
ATVA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...