Sciweavers

278 search results - page 8 / 56
» Pure Pattern Calculus
Sort
View
JAPLL
2006
87views more  JAPLL 2006»
14 years 11 months ago
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
Freek Wiedijk
ENTCS
2007
96views more  ENTCS 2007»
14 years 11 months ago
Cryptographic Pattern Matching
We construct a language extension for process calculi for modelling the exchange of cryptographically composed data. More specifically, we devise a succinct syntax for terms and ...
Christoffer Rosenkilde Nielsen, Flemming Nielson, ...
ENTCS
2008
100views more  ENTCS 2008»
14 years 11 months ago
A Calculus for Team Automata
Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patter...
Maurice H. ter Beek, Fabio Gadducci, Dirk Janssens
PODS
2010
ACM
187views Database» more  PODS 2010»
15 years 4 months ago
Incremental query evaluation in a ring of databases
This paper approaches the incremental view maintenance problem from an algebraic perspective. We construct a ring of databases and use it as the foundation of the design of a quer...
Christoph Koch
MFCS
2010
Springer
14 years 10 months ago
Resource Combinatory Algebras
Abstract. We initiate a purely algebraic study of Ehrhard and Regnier’s resource λ-calculus, by introducing three equational classes of algebras: resource combinatory algebras, ...
Alberto Carraro, Thomas Ehrhard, Antonino Salibra