131 search results - page 21 / 27 » On Monadic Theories of Monadic Predicates |
CADE
2008
Springer
15 years 10 months ago
2008
Springer
CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security prot...
81
Voted
PODS
2004
ACM
15 years 9 months ago
2004
ACM
We present the Lixto project, which is both a research project in database theory and a commercial enterprise that develops Web data extraction (wrapping) and Web service definiti...
124
Voted
SCP
2011
14 years 4 months ago
2011
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
102
click to vote
ACL
1997
14 years 11 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
FOSSACS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...