112 search results - page 5 / 23 » A type directed translation of MLF to system F |
FLAIRS
2004
13 years 8 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
ESOP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
POPL
2001
ACM
14 years 7 months ago
2001
ACM
We present a type system for a language based on F, which allows certain type annotations to be elided in actual programs. Local type inference determines types by a combination o...
ICFP
1997
ACM
13 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...