2152 search results - page 31 / 431 » On Automating the Calculus of Relations |
116
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
We introduce a dynamic logic that is enriched by non-rigid functions, i.e., functions that may change their value from state to state (during program execution), and we present a (...
117
click to vote
HICSS
2007
IEEE
15 years 10 months ago
2007
IEEE
Next-generation software engineering is envisioned as a computational discipline that complements human capability through automated computation of software behavior and propertie...
144
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
159
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
130
click to vote
FLOPS
2001
Springer
15 years 8 months ago
2001
Springer
We introduce a simply typed λ-calculus λκε which has both contexts and environments as first-class values. In λκε, holes in contexts are represented by ordinary variables ...