2152 search results - page 50 / 431 » On Automating the Calculus of Relations |
89
Voted
FOSSACS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vect...
101
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
94
Voted
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
We present an extension of the πI-calculus with formal sums of terms. The study of the properties of this sum reveals that its neutral element can be used to make assumptions abo...
103
Voted
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...
140
Voted
ACL2
2006
ACM
15 years 6 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...