Sciweavers

284 search results - page 36 / 57
» On Reversible Combinatory Logic
Sort
View
NDJFL
2002
74views more  NDJFL 2002»
13 years 9 months ago
The Semantics of Entailment Omega
This paper discusses the relation between the minimal positive relevant logic B+ and intersection and union type theories. There is a marvellous coincidence between these very diff...
Mariangiola Dezani-Ciancaglini, Robert K. Meyer, Y...
CALCO
2005
Springer
85views Mathematics» more  CALCO 2005»
14 years 3 months ago
Using Proofs by Coinduction to Find "Traditional" Proofs
In the specific situation of formal reasoning concerned with “regular expression equivalence” we address instances of more general questions such as: how can coinductive argum...
Clemens Grabmayer
FSTTCS
2007
Springer
14 years 1 months ago
Efficient and Expressive Tree Filters
Abstract. We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processin...
Michael Benedikt, Alan Jeffrey
LOGCOM
2010
158views more  LOGCOM 2010»
13 years 8 months ago
Applying Universal Algebra to Lambda Calculus
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
Giulio Manzonetto, Antonino Salibra
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 4 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...