3713 search results - page 150 / 743 » Constructing a Calculus of Programs |
146
click to vote
ENTCS
2002
15 years 3 months ago
2002
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
126
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
108
click to vote
JMIV
2008
15 years 3 months ago
2008
Moment invariants are features calculated on an image, which do not change their values after a transformation of the image. This paper focuses on the so called combined invariants...
112
click to vote
GPCE
2007
Springer
15 years 9 months ago
2007
Springer
Programming in an open environment remains challenging because it requires combining modularity, security, concurrency, distribution, and dynamicity. In this paper, we propose an ...
242
click to vote
POPL
2009
ACM
16 years 4 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...