1564 search results - page 32 / 313 » Extensions to the Estimation Calculus |
120
click to vote
ESOP
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...
110
click to vote
CADE
1997
Springer
15 years 6 months ago
1997
Springer
We present a matrix characterization of logical validity in the multiplicative fragment of linear logic. On this basis we develop a matrix-based proof search procedure for this fra...
103
click to vote
ICFP
1996
ACM
15 years 6 months ago
1996
ACM
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
101
click to vote
ZUM
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. This paper presents some of our requirements for a Z typechecker: that the typechecker accept all well-typeable formulations, however contrived; that it gather informatio...
102
click to vote
ENTCS
2008
15 years 2 months ago
2008
We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on strea...