1392 search results - page 27 / 279 » A Calculus for Dynamic Linking |
POPL
1989
ACM
14 years 26 days ago
1989
ACM
Dynamic typing can be useful in statically typed languages. We extend the simply typed λ-calculus with dynamic typing and elaborate additional features like polymorphism and subty...
AADEBUG
1997
Springer
14 years 1 months ago
1997
Springer
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...
ICFP
2003
ACM
14 years 8 months ago
2003
ACM
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
JFP
2008
13 years 8 months ago
2008
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
CADE
1999
Springer
14 years 1 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...