Sciweavers

6 search results - page 1 / 2
» Simple, partial type-inference for System F based on type-co...
Sort
View
ICFP
2005
ACM
14 years 4 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy
POPL
2001
ACM
14 years 5 months ago
Colored local type inference
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...
Martin Odersky, Christoph Zenger, Matthias Zenger
CADE
1990
Springer
13 years 8 months ago
IMPS: An Interactive Mathematical Proof System
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
William M. Farmer, Joshua D. Guttman, F. Javier Th...
POPL
2006
ACM
14 years 5 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
AAAI
2007
13 years 7 months ago
Equilibria in Heterogeneous Nonmonotonic Multi-Context Systems
We propose a general framework for multi-context reasoning which allows us to combine arbitrary monotonic and nonmonotonic logics. Nonmonotonic bridge rules are used to specify th...
Gerhard Brewka, Thomas Eiter