Sciweavers

2272 search results - page 199 / 455
» A Calculus for
Sort
View
151
Voted
GECCO
1999
Springer
106views Optimization» more  GECCO 1999»
15 years 9 months ago
Generating Lemmas for Tableau-based Proof Search Using Genetic Programming
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...
Marc Fuchs, Dirk Fuchs, Matthias Fuchs
ZUM
1998
Springer
111views Formal Methods» more  ZUM 1998»
15 years 8 months ago
Combining Specification Techniques for Processes, Data and Time
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...
Ernst-Rüdiger Olderog
135
Voted
CADE
1997
Springer
15 years 8 months ago
Connection-Based Proof Construction in Linear Logic
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...
Christoph Kreitz, Heiko Mantel, Jens Otten, Stepha...
128
Voted
ICFP
1996
ACM
15 years 8 months ago
Inductive, Coinductive, and Pointed Types
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...
Brian T. Howard
TAPSOFT
1997
Springer
15 years 8 months ago
A Typed Intermediate Language for Flow-Directed Compilation
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...
J. B. Wells, Allyn Dimock, Robert Muller, Franklyn...