3713 search results - page 85 / 743 » Constructing a Calculus of Programs |
TABLEAUX
2005
Springer
15 years 8 months ago
2005
Springer
We extend classical first-order logic with subtyping by type predicates and type coercion. Type predicates assert that the value of a term belongs to a more special type than the ...
117
click to vote
ENTCS
2002
15 years 2 months ago
2002
This article discusses mutation testing strategies in the context of refinement. Here, a novel generalization of mutation testing techniques is presented to be applied to contract...
151
click to vote
PLPV
2009
ACM
15 years 12 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
203
click to vote
ECOOP
2009
Springer
16 years 3 months ago
2009
Springer
We present FJig, a simple calculus where basic building blocks are classes in the style of Featherweight Java, declaring elds, methods and one constructor. However, inheritance has...
155
click to vote
ESOP
2010
Springer
15 years 10 months ago
2010
Springer
Stream processing applications such as algorithmic trading, MPEG processing, and web content analysis are ubiquitous and essential to business and entertainment. Language designers...