900 search results - page 11 / 180 » Pure Type Systems Formalized |
MPC
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. This paper is about exceptions handling using classical techniques of program extraction. We propose an impredicative formalization in the calculus of constructions and w...
BIRTHDAY
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
ECOOP
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. We are interested in the class of systems for which the satisfaction of code dependencies is a dynamic process rather than one which is determined purely at load-time. Ex...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
ICECCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Being a successful technique in software practice, Object Orientation (OO) is a hot topic in academic research fields. Among many formalisms, rCOS, a refinement calculus of obje...