Sciweavers

233 search results - page 39 / 47
» Computational Lambda-Calculus and Monads
Sort
View
DIMACS
1996
13 years 8 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
IPPS
2006
IEEE
14 years 1 months ago
An overview of the Jahob analysis system: project goals and current status
We present an overview of the Jahob system for modular analysis of data structure properties. Jahob uses a subset of Java as the implementation language and annotations with formu...
Viktor Kuncak, Martin C. Rinard
LICS
2005
IEEE
14 years 1 months ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey
RTA
2005
Springer
14 years 29 days 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
BIRTHDAY
2006
Springer
13 years 11 months ago
Uniform Functors on Sets
This paper is a contribution to the study of uniformity conditions for endofunctors on sets initiated in Aczel [1] and pursued later in other works such as Turi [17]. The main res...
Lawrence S. Moss