95 search results - page 1 / 19 » CIA Structures and the Semantics of Recursion |
FOSSACS
2010
Springer
13 years 11 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
SBMF
2010
Springer
12 years 11 months ago
2010
Springer
This paper presents a framework to reason about the eects of assignments in recursive data structures. We dene an operational semantics for a core language based on Meyer's id...
ICFP
1998
ACM
13 years 8 months ago
1998
ACM
In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion...
CIA
2004
Springer
13 years 10 months ago
2004
Springer
Given a specification of communication rules in a multiagent system (in the form of protocols, ACL semantics, etc.), the question of how to design appropriate agents that can oper...
CORR
2008
Springer
13 years 3 months ago
2008
Springer
A type-based approach to termination uses sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted i...