Sciweavers

37 search results - page 6 / 8
» Subtyping Constraints in Quasi-lattices
Sort
View
ECOOP
2009
Springer
14 years 8 months ago
Checking Framework Interactions with Relationships
Software frameworks impose constraints on how plugins may interact with them. Many of hese constraints involve multiple objects, are temporal, and depend on runtime values. Additi...
Ciera Jaspan, Jonathan Aldrich
FLOPS
1999
Springer
13 years 11 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer
LICS
2010
IEEE
13 years 5 months ago
Equality Is Typable in Semi-full Pure Type Systems
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
Vincent Siles, Hugo Herbelin
SCP
2010
155views more  SCP 2010»
13 years 5 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
ACMSE
2006
ACM
14 years 1 months ago
Type inference and informative error reporting for secure information flow
If we classify the variables of a program into various security levels, then a secure information flow analysis aims to verify statically that information in the program can flo...
Zhenyue Deng, Geoffrey Smith