2436 search results - page 70 / 488 » Comonadic Notions of Computation |
123
Voted
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
119
Voted
ICTCS
2003
Springer
15 years 9 months ago
2003
Springer
We define a calculus for modeling dynamic linking independently of the details of a particular programming environment. The calculus distinguishes at the language level the notion...
132
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— This paper extends a state projection method for structure preserving model reduction to situations where only a weaker notion of system structure is available. This weaker not...
141
Voted
LFCS
1994
Springer
15 years 7 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
115
Voted
AI
2006
Springer
15 years 3 months ago
2006
Springer
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...