900 search results - page 16 / 180 » Pure Type Systems Formalized |
FASE
2000
Springer
13 years 11 months ago
2000
Springer
state-based approach KIV uses abstract state machines (ASMs, [5]) over algebraically specified data types. The semantics of an ASM is the set of
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We present a type theory for higher-order modules that accounts for many central issues in module system design, including translucency, applicativity, generativity, and modules a...
JOT
2007
13 years 7 months ago
2007
ome this restriction, we develop so-called loose domains which abstract over several precise domains. Similar to the relation between supertypes and subtypes, we get a relation bet...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
In object-oriented programming, unique permissions to object references are useful for checking correctness properties such as consistency of typestate and noninterference of conc...