3713 search results - page 172 / 743 » Constructing a Calculus of Programs |
149
Voted
PPDP
2010
Springer
15 years 1 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
140
Voted
KBSE
1997
IEEE
15 years 7 months ago
1997
IEEE
Given a program S and a precondition Q, the strongest postcondition, denoted sp(S Q), is defined as the strongest condition that holds after the execution of S, given that S term...
104
Voted
ICFP
2010
ACM
15 years 4 months ago
2010
ACM
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
111
Voted
APPT
2007
Springer
15 years 9 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
225
Voted
POPL
2006
ACM
16 years 3 months ago
2006
ACM
Traditional static type systems are very effective for verifying basic interface specifications, but are somewhat limited in the kinds specificationsthey support. Dynamically-chec...