2272 search results - page 199 / 455 » A Calculus for |
184
click to vote
GECCO
1999
Springer
15 years 11 months ago
1999
Springer
Top-down or analytical provers based on the connection tableau calculus are rather powerful, yet have notable shortcomings regarding redundancy control. A well-known and successfu...
190
click to vote
ZUM
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We present a new combination CSP-OZ-DC of three well researched formal techniques for the specification of processes, data and time: CSP [17], Object-Z [36], and Duration...
172
click to vote
CADE
1997
Springer
15 years 10 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...
155
click to vote
ICFP
1996
ACM
15 years 10 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...
201
Voted
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
We present a typed intermediate language λCIL for optimizing compilers for function-oriented and polymorphically typed programming languages (e.g., ML). The language λCIL is a ty...