249 search results - page 3 / 50 » Principals in Programming Languages: A Syntactic Proof Techn... |
ESOP
2004
Springer
13 years 11 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
ICFP
1999
ACM
13 years 10 months ago
1999
ACM
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
ESOP
2007
Springer
14 years 13 days ago
2007
Springer
Abstract. Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these fe...
APLAS
2006
ACM
14 years 7 days ago
2006
ACM
straction for Imperative Languages William L. Harrison Dept. of Computer Science, University of Missouri, Columbia, Missouri, USA. ty in programming language semantics derives fro...
LICS
2009
IEEE
14 years 27 days ago
2009
IEEE
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...