402 search results - page 52 / 81 » Engineering a Programming Language: The Type and Class Syste... |
PLDI
2012
ACM
11 years 10 months ago
2012
ACM
Self-stabilizing programs automatically recover from state corruption caused by software bugs and other sources to reach the correct state. A number of applications are inherently...
SIGSOFT
2000
ACM
13 years 11 months ago
2000
ACM
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
TIC
1998
Springer
13 years 11 months ago
1998
Springer
Polymorphic equality is a controversial language construct. While being convenient for the programmer, it has been argued that polymorphic equality (1) invites to violation of soft...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
TACS
1991
Springer
13 years 11 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...