%0 Conference Proceedings
%T From urelements to Computation
%+ CNR Istituto di Scienza e Tecnologie dell’Informazione “A. Faedo” [Pisa] (CNR | ISTI)
%A Ciancia, Vincenzo
%Z Part 2: Regular Submissions
%< avec comité de lecture
%( IFIP Advances in Information and Communication Technology
%B 3rd International Conference on History and Philosophy of Computing (HaPoC)
%C Pisa, Italy
%3 History and Philosophy of Computing
%V AICT-487
%P 141-155
%8 2015-10-08
%D 2015
%R 10.1007/978-3-319-47286-7_10
%Z Computer Science [cs]Conference papers
%X Around 1922-1938, a new permutation model of set theory was defined. The permutation model served as a counterexample in the first proof of independence of the Axiom of Choice from the other axioms of Zermelo-Fraenkel set theory. Almost a century later, a model introduced as part of a proof in abstract mathematics fostered a plethora of research results, ranging from the area of syntax and semantics of programming languages to minimization algorithms and automated verification of systems. Among these results, we find Lawvere-style algebraic syntax with binders, final-coalgebra semantics with resource allocation, and minimization algorithms for mobile systems. These results are also obtained in various different ways, by describing, in terms of category theory, a number of models equivalent to the permutation model.We aim at providing both a brief history of some of these developments, and a mild introduction to the recent research line of “nominal computation theory”, where the essential notion of name is declined in several different ways.
%G English
%Z TC 9
%2 https://inria.hal.science/hal-01615302/document
%2 https://inria.hal.science/hal-01615302/file/432590_1_En_10_Chapter.pdf
%L hal-01615302
%U https://inria.hal.science/hal-01615302
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-TC9
%~ IFIP-AICT-487
%~ IFIP-HAPOC