43 search results - page 9 / 9 » Presheaf Models for the pi-Calculus |
IANDC
2010
13 years 4 months ago
2010
The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
ENTCS
2008
13 years 5 months ago
2008
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
TLCA
2009
Springer
14 years 2 days ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...