122
click to vote
ICFP
16 years 1 months ago
2003 ACM 
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
120
click to vote
ICFP
16 years 1 months ago
2003 ACM
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
ICFP
16 years 1 months ago
2003 ACM
We propose a type system MLFthat generalizes ML with first-class polymorphism as in System F. Expressions may contain secondorder type annotations. Every typable expression admits...
132
click to vote
ICFP
16 years 1 months ago
2003 ACM 
This paper presents a static type system for JAVA Virtual Machine (JVM) code that enforces an access control mechanism similar to the one found, for example, in a JAVA implementat...
ICFP
16 years 1 months ago
2003 ACM |
Programming Languages