3239 search results - page 363 / 648 » A Logical Process Calculus |
138
click to vote
ENTCS
2006
15 years 4 months ago
2006
In the domain of embedded software systems the increasing complexity of the functionality as well as the increase in variations caused by product lines requires a modular design p...
131
click to vote
CADE
2001
Springer
16 years 4 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
166
click to vote
PLPV
2010
ACM
16 years 1 months ago
2010
ACM
Singleton types are often considered a poor man’s substitute for dependent types. But their generalization in the form of GADTs has found quite a following. The main advantage o...
160
Voted
TLDI
2005
ACM
15 years 9 months ago
2005
ACM
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
134
click to vote
OOPSLA
2005
Springer
15 years 9 months ago
2005
Springer
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...