%0 Conference Proceedings
%T Classical Higher-Order Processes
%+ University of Southern Denmark (SDU)
%A Montesi, Fabrizio
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 37th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
%C Neuchâtel, Switzerland
%Y Ahmed Bouajjani
%Y Alexandra Silva
%I Springer International Publishing
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-10321
%P 171-178
%8 2017-06-19
%D 2017
%R 10.1007/978-3-319-60225-7_12
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Classical Processes (CP) is a calculus where the proof theory of classical linear logic types processes à la $$\pi $$-calculus, building on a Curry-Howard correspondence between session types and linear propositions. We contribute to this research line by extending CP with process mobility, inspired by the Higher-Order $$\pi $$-calculus. The key to our calculus is that sequents are asymmetric: one side types sessions as in CP and the other types process variables, which can be instantiated with process values. The controlled interaction between the two sides ensures that process variables can be used at will, but always respecting the linear usage of sessions expected by the environment.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01658427/document
%2 https://inria.hal.science/hal-01658427/file/446833_1_En_12_Chapter.pdf
%L hal-01658427
%U https://inria.hal.science/hal-01658427
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-LNCS-10321