365 search results - page 2 / 73 » Using Types as Approximations for Type Checking Prolog Progr... |
SFP
2001
13 years 7 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
POPL
2010
ACM
14 years 3 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
PLDI
2011
ACM
12 years 9 months ago
2011
ACM
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
ICFP
2002
ACM
14 years 6 months ago
2002
ACM
Even when programming in a statically typed language we every now and then encounter statically untypable values; such values result from interpreting values or from communicating...
SCP
2010
13 years 4 months ago
2010
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...