Book of Abstracts - IRIT

More documents

Recommendations

Info

TYPES 2013 Contributed Talks Contributed Talks Copatterns: Programming Infinite Structures by Observations . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 Andreas Abel Update monads: cointerpreting directed containers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 Danel Ahman and Tarmo Uustalu Mendler-style Recursion Schemes for Mixed-Variant Datatypes . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 Ki Yung Ahn, Tim Sheard and Marcelo Fiore Univalent categories and the Rezk completion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 Benedikt Ahrens, Krzysztof Kapulkin and Michael Shulman Formal Non-linear Optimization via Templates and Sum-of-Squares . . . . . . . . . . . . . . . . . . . . . . 22 Xavier Allamigeon, Stéphane Gaubert, Victor Magron and Benjamin Werner Weak omega groupoids and beyond . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 Thorsten Altenkirch Strong Normalization for Intuitionistic Arithmetic with 1-Excluded Middle . . . . . . . . . . . . . . . 26 Federico Aschieri, Stefano Berardi and Giovanni Birolo Towards Infinite Terms in Twelf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 Maxime Beauquier A learning-based interpretation for polymorphic lambda-calculus . . . . . . . . . . . . . . . . . . . . . . . . . 30 Stefano Berardi Are streamless sets Noetherian? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 Marc Bezem, Thierry Coquand and Keiko Nakata Realizability for Peano Arithmetic with Winning Conditions in HON Games. . . . . . . . . . . . . . 34 Valentin Blot A Hybrid Linear Logic for Constrained Transition Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 Kaustuv Chaudhuri and Joëlle Despeyroux Revisiting the bookkeeping technique in HOAS based encodings . . . . . . . . . . . . . . . . . . . . . . . . . . 38 Alberto Ciaffaglione and Ivan Scagnetto Lightweight proof by reflection using a posteriori simulation of effectful computation. . . . . . 40 Guillaume Claret, Lourdes del Carmen González Huesca, Yann Régis-Gianas and Beta Ziliani Computable Refinements by Quotients and Parametricity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 Cyril Cohen, Maxime Dénès and Anders Mörtberg Formalizing Subsumption Relations in Ontologies using Type Classes in Coq . . . . . . . . . . . . . 44 Richard Dapoigny and Patrick Barlatier Mechanized semantics for an Algol-like language. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Daniel Fridlender, Miguel Pagano and Leonardo Rodríguez Nested Typing and Communication in the lambda-calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 Nicolas Guenot 12
TYPES 2013 Contributed Talks Some reflections about equality in type theory (tentative material for further research) . . . 50 Hugo Herbelin The Rooster and the Syntactic Bracket . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 Hugo Herbelin and Arnaud Spiwack Effective Types for C formalized in Coq . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54 Robbert Krebbers Type-based Human-Computer Interaction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56 Peter Ljunglöf Subtyping in Type Theory: Coercion Contexts and Local Coercions . . . . . . . . . . . . . . . . . . . . . . 58 Zhaohui Luo and Fedor Part Probability Logics in Coq . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60 Petar Maksimović A Dependent Delimited Continuation Monad . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 Pierre-Marie Pédrot Type-theoretical natural language semantics: on the system F for meaning assembly . . . . . . 64 Christian Retoré Sets in homotopy type theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66 Egbert Rijke and Bas Spitters Polymorphic variants in dependent type theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68 Claudio Sacerdoti Coen and Dominic Mulligan Viewing Lambda-Terms through Maps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70 Masahiko Sato, Randy Pollack, Helmut Schwichtenberg and Takafumi Sakurai Positive Logic Is 2-Exptime Hard. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 Aleksy Schubert, Paweł Urzyczyn and Daria Walukiewicz-Chrząszcz Unfolding Nested Patterns and Copatterns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74 Anton Setzer Universe Polymorphism and Inference in Coq. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76 Matthieu Sozeau Fully abstract semantics of lambda-mu with explicit substitution in the pi-calculus . . . . . . . 78 Steffen van Bakel and Maria Grazia Vigliotti A very generic implementation of data-types with binders in Coq . . . . . . . . . . . . . . . . . . . . . . . . . 80 Benjamin Werner 13
Page 1: Types for Proofs and Programs 19th
Page 5 and 6: TYPES 2013 Preface Preface This is
Page 7 and 8: TYPES 2013 Invited Talks Invited Ta
Page 10: Charge! a framework for higher-orde
Page 13: Types in Proof Mining Ulrich Kohlen
Page 18 and 19: Update Monads: Cointerpreting Direc
Page 20 and 21: Mendler-style Recursion Schemes for
Page 22 and 23: Univalent categories and the Rezk c
Page 24 and 25: Formal Non-linear Optimization via
Page 26: Weak ω-groupoids and beyond. (Abst
Page 29 and 30: Strong Normalization for HA + 1 −
Page 31 and 32: Towards Infinite Terms in Twelf Max
Page 33 and 34: A learning-based interpretation for
Page 35 and 36: Are streamless sets Noetherian? Bez
Page 37 and 38: Realizability for Peano Arithmetic
Page 39 and 40: A Hybrid Linear Logic for Constrain
Page 41 and 42: Revisiting the bookkeeping techniqu
Page 43 and 44: to be executed with the help of wha
Page 45 and 46: Computable Refinements by Quotients
Page 47 and 48: Formalizing Subsumption Relations i
Page 49 and 50: Mechanized semantics for an Algol-l
Page 51 and 52: Nested Typing and Communication in
Page 53 and 54: Some reflections about equality in
Page 55 and 56: The Rooster and the Syntactic Brack
Page 57 and 58: Effective Types for C formalized in
Page 59 and 60: Type-based Human-Computer Interacti
Page 61 and 62: Coercion Contexts and Local Coercio
Page 63 and 64: Probability Logics in Coq Petar Mak
Page 65 and 66:
A Dependent Delimited Continuation
Page 67 and 68:
On the system F for meaning assembl
Page 69 and 70:
Sets in homotopy type theory Egbert
Page 71 and 72:
Polymorphic variants in dependent t
Page 73 and 74:
Viewing λ-terms through Maps Sato,
Page 75 and 76:
Positive Logic Is 2-Exptime Hard Sc
Page 77 and 78:
Unfolding Nested Patterns and Copat
Page 79 and 80:
Universe Polymorphism and Inference
Page 81 and 82:
Fully abstract semantics of λµ wi
Page 83 and 84:
A very generic implementation of da
Page 85 and 86:
TYPES 2013 Author Index Maksimović
show all

Book of Abstracts - IRIT

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?