Výsledky vyhledávání

Autor: Marc Lasson, Jonathan Hayman, Simon Castellan, Glynn Winskel

Publikováno v: MFPS
MFPS 2014
MFPS 2014, Jun 2014, Ithaca, United States. pp.87-107, ⟨10.1016/j.entcs.2014.10.006⟩

International audience; Concurrent strategies are shown to support operations yielding an economic yet rich higher-order con-current process language, which shares features both with process calculi and nondeterministic dataflow. Its operational sema

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1edf765ec97bf0529b205905f20c667
https://doi.org/10.1016/j.entcs.2014.10.006

Zobrazit plný text záznamu

Canonicity of Weak ω-groupoid Laws Using Parametricity Theory

Autor: Marc Lasson

Publikováno v: Electronic Notes in Theoretical Computer Science
MFPS 2014
MFPS 2014, Jun 2014, Ithaca, United States. pp.229-244, ⟨10.1016/j.entcs.2014.10.013⟩
MFPS

International audience; We show that terms witnessing a groupoid law from the ω-groupoid structure of types are all propositionally equal. Our proof reduce this problem to the unicity of the canonical point in the n-th loop space and conclude using

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1ce870361f5c8f9a87ad59bc76cc590

Zobrazit plný text záznamu

Controlling Program Extraction in Light Logics

Autor: Marc Lasson

Publikováno v: Typed Lambda Calculi and Applications 10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011. Proceedings
Typed Lambda Calculi and Applications 10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011.
Typed Lambda Calculi and Applications 10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011., Jun 2011, Novi Sad, Serbia. pp.123-137, ⟨10.1007/978-3-642-21691-6⟩
Lecture Notes in Computer Science ISBN: 9783642216909
TLCA

15 pages; International audience; We present two refinements, based on program extraction in elementary affine logic and light affine logic, of Krivine & Leivant's system FA2. This system allows higher-order equations to specify the computational con

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d62ee3c97a9615d6b72d233186afcb9
https://hal.archives-ouvertes.fr/hal-00605654