Sciweavers

63 search results - page 3 / 13
» On Completeness of Logical Relations for Monadic Types
Sort
View
RTA
2005
Springer
13 years 11 months ago
Automata and Logics for Unranked and Unordered Trees
In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unord...
Iovka Boneva, Jean-Marc Talbot
ACS
2005
13 years 5 months ago
Relating Categorical Semantics for Intuitionistic Linear Logic
There are several kinds of linear typed calculus in the literature, some with their associated notion of categorical model. Our aim in this paper is to systematise the relationshi...
Maria Emilia Maietti, Paola Maneggia, Valeria de P...
TPHOL
2008
IEEE
13 years 12 months ago
A Type of Partial Recursive Functions
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Ana Bove, Venanzio Capretta
LICS
2008
IEEE
13 years 12 months ago
Structural Logical Relations
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
Carsten Schürmann, Jeffrey Sarnat
DAS
2004
Springer
13 years 11 months ago
A Complete Approach to the Conversion of Typewritten Historical Documents for Digital Archives
This paper presents a complete system that historians/archivists can use to digitize whole collections of documents relating to personal information. The system integrates tools an...
Apostolos Antonacopoulos, Dimosthenis Karatzas