[TYPES/announce] LOLA deadline extension
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Dear all, The deadline for talk submissions to LOLA at LICS has been extended until April 23. Note also that Aaron Stump has been added as invited speaker. We expect to announce one more invited speaker soon. Best wishes, Rasmus and Patricia --- LOLA 2019: Syntax and Semantics of Low-Level Languages = Sunday, 23 June 2019, Vancouver, Canada A satellite workshop of LICS 2019 https://cs.appstate.edu/~johannp/lola19/ Important dates - LOLA submission deadline 23 April 2019 Notification 13 May 2019 Workshop 23 June 2019 - Submission: https://easychair.org/conferences/?conf=lola2019 Context --- Since the late 1960s it has been known that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high-level programming languages, and to the development of reasoning principles for such languages. Yet low-level languages, such as machine code, and the compilation of high-level languages into low-level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of the past two decades has been that low-level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low-level languages (such as heaps, registers and code pointers) and low-level properties of programs (such as resource usage) goes hand in hand with some of the most advanced contemporary research in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and resource bounded programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in the relationships and connections between logic and low-level languages and programs. Topics of interest include, but are not limited to: * Typed assembly languages, * Certified assembly programming, * Certified and certifying compilation, * Proof-carrying code, * Program optimization, * Modal logic and realizability in machine code, * Realizability and double orthogonality in assembly code, * Parametricity, modules and existential types, * General references, Kripke models and recursive types, * Continuations and concurrency, * Resource analysis and implicit complexity, * Closures and explicit substitutions, * Linear logic and separation logic, * Game semantics, abstract machines and hardware synthesis, * Monoidal and premonoidal categories, traces and effects. Submission -- LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, in the form of a two page abstract (excluding references, acknowledgements, and appendices). Full papers (published or unpublished) may be included as appendices, but note that reviewers are not required to read appendices. Authors are invited to submit their contribution by 15 April 2019. Abstracts must be written in English and be submitted as a single PDF file at EasyChair: https://easychair.org/conferences/?conf=lola2019 Submissions will undergo a lightweight review process and will be judged on originality, relevance, interest and clarity. Submission should describe novel works or works that have already appeared elsewhere but that can stimulate the discussion between different communities at the workshop. At least one author of an accepted workshop proposal must be registered for the workshop. The workshop will not have formal proceedings and is not intended to preclude later publication at another venue. Invited Speakers Aaron Stump + one more TBA Program Committee - * Amal Ahmed Northeastern University * Simon Castellan Imperial College * Jan Hoffmann Carnegie Mellon University * Patricia Johann (co-chair) Appalachian State University * Rasmus Møgelberg (co-chair) IT University of Copenhagen * Guillaume Munch-Maccagnoni Inria * Magnus MyreenChalmers University of Technology * Dominic Orchard University of Kent * Azalea Raad MPI-SWS * Ulrich SchöppLMU
[TYPES/announce] LOLA 2nd call for talk proposals
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Call for talk proposals. LOLA 2019: Syntax and Semantics of Low-Level Languages = Sunday, 23 June 2019, Vancouver, Canada A satellite workshop of LICS 2019 https://cs.appstate.edu/~johannp/lola19/ Important dates - LOLA submission deadline 15 April 2019 Notification 13 May 2019 Workshop 23 June 2019 - Submission: https://easychair.org/conferences/?conf=lola2019 Context --- Since the late 1960s it has been known that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high-level programming languages, and to the development of reasoning principles for such languages. Yet low-level languages, such as machine code, and the compilation of high-level languages into low-level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of the past two decades has been that low-level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low-level languages (such as heaps, registers and code pointers) and low-level properties of programs (such as resource usage) goes hand in hand with some of the most advanced contemporary research in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and resource bounded programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in the relationships and connections between logic and low-level languages and programs. Topics of interest include, but are not limited to: * Typed assembly languages, * Certified assembly programming, * Certified and certifying compilation, * Proof-carrying code, * Program optimization, * Modal logic and realizability in machine code, * Realizability and double orthogonality in assembly code, * Parametricity, modules and existential types, * General references, Kripke models and recursive types, * Continuations and concurrency, * Resource analysis and implicit complexity, * Closures and explicit substitutions, * Linear logic and separation logic, * Game semantics, abstract machines and hardware synthesis, * Monoidal and premonoidal categories, traces and effects. Submission -- LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, in the form of a two page abstract (excluding references, acknowledgements, and appendices). Full papers (published or unpublished) may be included as appendices, but note that reviewers are not required to read appendices. Authors are invited to submit their contribution by 15 April 2019. Abstracts must be written in English and be submitted as a single PDF file at EasyChair: https://easychair.org/conferences/?conf=lola2019 Submissions will undergo a lightweight review process and will be judged on originality, relevance, interest and clarity. Submission should describe novel works or works that have already appeared elsewhere but that can stimulate the discussion between different communities at the workshop. At least one author of an accepted workshop proposal must be registered for the workshop. The workshop will not have formal proceedings and is not intended to preclude later publication at another venue. Invited Speakers TBD Program Committee - * Amal Ahmed Northeastern University * Simon Castellan Imperial College * Jan Hoffmann Carnegie Mellon University * Patricia Johann (co-chair) Appalachian State University * Rasmus Møgelberg (co-chair) IT University of Copenhagen * Guillaume Munch-Maccagnoni Inria * Magnus MyreenChalmers University of Technology * Dominic Orchard University of Kent * Azalea Raad MPI-SWS * Ulrich SchöppLMU Munich * Nicolas Tabareau Inria * Tarmo UustaluReykjavik University
[TYPES/announce] LOLA call for talk proposals
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Call for talk proposals. LOLA 2019: Syntax and Semantics of Low-Level Languages = Sunday, 23 June 2019, Vancouver, Canada A satellite workshop of LICS 2019 https://cs.appstate.edu/~johannp/lola19/ Important dates - LOLA submission deadline 15 April 2019 Notification 13 May 2019 Workshop 23 June 2019 - Submission: https://easychair.org/conferences/?conf=lola2019 Context --- Since the late 1960s it has been known that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high-level programming languages, and to the development of reasoning principles for such languages. Yet low-level languages, such as machine code, and the compilation of high-level languages into low-level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of the past two decades has been that low-level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low-level languages (such as heaps, registers and code pointers) and low-level properties of programs (such as resource usage) goes hand in hand with some of the most advanced contemporary research in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and resource bounded programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in the relationships and connections between logic and low-level languages and programs. Topics of interest include, but are not limited to: * Typed assembly languages, * Certified assembly programming, * Certified and certifying compilation, * Proof-carrying code, * Program optimization, * Modal logic and realizability in machine code, * Realizability and double orthogonality in assembly code, * Parametricity, modules and existential types, * General references, Kripke models and recursive types, * Continuations and concurrency, * Resource analysis and implicit complexity, * Closures and explicit substitutions, * Linear logic and separation logic, * Game semantics, abstract machines and hardware synthesis, * Monoidal and premonoidal categories, traces and effects. Submission -- LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, in the form of a two page abstract (excluding references, acknowledgements, and appendices). Full papers (published or unpublished) may be included as appendices, but note that reviewers are not required to read appendices. Authors are invited to submit their contribution by 15 April 2019. Abstracts must be written in English and be submitted as a single PDF file at EasyChair: https://easychair.org/conferences/?conf=lola2019 Submissions will undergo a lightweight review process and will be judged on originality, relevance, interest and clarity. Submission should describe novel works or works that have already appeared elsewhere but that can stimulate the discussion between different communities at the workshop. At least one author of an accepted workshop proposal must be registered for the workshop. The workshop will not have formal proceedings and is not intended to preclude later publication at another venue. Invited Speakers TBD Program Committee - * Amal Ahmed Northeastern University * Simon Castellan Imperial College * Jan Hoffmann Carnegie Mellon University * Patricia Johann (co-chair) Appalachian State University * Rasmus Møgelberg (co-chair) IT University of Copenhagen * Guillaume Munch-Maccagnoni Inria * Magnus MyreenChalmers University of Technology * Dominic Orchard University of Kent * Azalea Raad MPI-SWS * Ulrich SchöppLMU Munich * Nicolas Tabareau Inria * Tarmo UustaluReykjavik University
[TYPES/announce] Fully funded PhD scholarship at the IT University of Copenhagen
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Dear all, As part of the research project Type Theories for Reactive Programming funded by Villum Fonden, I have an opening for a fully funded PhD scholarship at the IT University of Copenhagen starting this year. The aim of the project is to construct a (dependent) type theory for programming and reasoning about reactive systems, using modalities to encode productivity. The design of the type theory will be based on denotational models, so the ideal candidate will have knowledge of category theory and type theory, but this is not a requirement. Further details on the project and how to apply can be found here: https://tinyurl.com/y87wnwnq Please feel free also to contact me directly for further details. A more detailed description of the project can be found below. Best wishes, Rasmus Møgelberg - Project description Type theories are formal systems that can be viewed both as programming languages and logical systems for formalised mathematics. From a computer science perspective this is useful because it allows for programs, their specifications, and the proofs that these satisfy the specification to be expressed in the same formalism. The logical interpretation of type theories means that all programs must terminate. For this reason, programming and reasoning about non-terminating reactive programs in type theory remains a challenge. This is unfortunate since these include many of the most critical programs in use today. In this project we aim to design a new type theory useful for programming with and reasoning about reactive programs. We build on recent progress in guarded recursion and functional reactive programming, using modal type constructors to capture productivity in types, as well as other recent advances in type theory, including homotopy type theory. We will use mathematical modelling when constructing the type theory and reasoning about consistency. The preferred candidate will therefore have knowledge of category theory and denotational semantics, but this is not a requirement. Experience with type theory or proof assistants is also an advantage, but not required.
[TYPES/announce] Postdoc position at IT University of Copenhagen
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Dear all, I would like to advertise a 2-year postdoc position available at the IT University of Copenhagen, Denmark. The suggested starting date is August 2017, but this is negotiable. The position is part of my research project Type Theories for Reactive Programming funded by Villum Fonden, and running for 5 years involving 2 PhDs and 2 postdoc positions in total. I include a short description of the goals of the project below. Applicants should have experience with category theory and denotational semantics. Knowledge of models of (dependent) type theory or functional reactive programming is an advantage, but is not required. The deadline for application is February 28. Further information on the position and how to apply can be found here: http://bit.ly/2kl7zRy I encourage all interested in applying to contact me in advance. Rasmus Møgelberg - Project description Type theories are formal systems that can be viewed both as programming languages and logical systems for formalised mathematics. From a computer science perspective, this is useful because it allows for programs, their specifications, and the proofs that these satisfy the specification to be expressed in the same formalism. The logical interpretation of type theories means that all programs must terminate. For this reason, programming and reasoning about non-terminating reactive programs in type theory remains a challenge. This is unfortunate since these include many of the most critical programs in use today. In this project, we aim to design a new type theory useful for programming with and reasoning about reactive programs. We build on recent progress in guarded recursion and functional reactive programming, using modalities to capture productivity in types. The project also involves the development of Guarded Cubical Type Theory, an extension of Cubical Type Theory with guarded recursive types. These can be used for smooth programming with coinductive types and construction of models of advanced programming languages. This part of the project is a collaboration with professor Lars Birkedal at Aarhus University. Type theories are formal systems that can be viewed both as programming languages and logical systems for formalised mathematics. From a computer science perspective, this is useful because it allows for programs, their specifications, and the proofs that these satisfy the specification to be expressed in the same formalism. The logical interpretation of type theories means that all programs must terminate. For this reason, programming and reasoning about non-terminating reactive programs in type theory remains a challenge. This is unfortunate since these include many of the most critical programs in use today. In this project, we aim to design a new type theory useful for programming with and reasoning about reactive programs. We build on recent progress in guarded recursion and functional reactive programming, using modalities to capture productivity in types. The project also involves the development of Guarded Cubical Type Theory, an extension of Cubical Type Theory with guarded recursive types. These can be used for smooth programming with coinductive types and construction of models of advanced programming languages. This part of the project is a collaboration with professor Lars Birkedal at Aarhus University. - See more at: https://candidate.hr-manager.net/ApplicationInit.aspx?cid=119=180828=5#sthash.uggmBukd.dpu Project description Type theories are formal systems that can be viewed both as programming languages and logical systems for formalised mathematics. From a computer science perspective, this is useful because it allows for programs, their specifications, and the proofs that these satisfy the specification to be expressed in the same formalism. The logical interpretation of type theories means that all programs must terminate. For this reason, programming and reasoning about non-terminating reactive programs in type theory remains a challenge. This is unfortunate since these include many of the most critical programs in use today. In this project, we aim to design a new type theory useful for programming with and reasoning about reactive programs. We build on recent progress in guarded recursion and functional reactive programming, using modalities to capture productivity in types. The project also involves the development of Guarded Cubical Type Theory, an extension of Cubical Type Theory with guarded recursive types. These can be used for smooth programming with coinductive types and construction of models of advanced programming languages. This part of the project is a collaboration with professor Lars Birkedal at Aarhus University. - See more at:
[TYPES/announce] Post doc at IT University of Copenhagen
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Dear all, I have an available post doc position at the IT University of Copenhagen. My funding covers two years, but for administrative reasons the contract will be initially for one year with the possibility of extension for one more. Ideally, I would like the post doc to start in August, but I realize that this is a very short notice, so the starting date can be postponed until January 1st if needed. The post doc will work on a project on guarded recursion, which is an approach to the problem of augmenting type theory with recursion without breaking consistency. Perhaps more accurately, it can be described as a synthetic approach to step-indexing with applications also to the problem om checking productivity of coinductive definitions. We are currently working on rewrite semantics and an implementation of an extension of cubical type theory with guarded recursion. I would prefer to hire someone who can work on these projects, but there is also work to be done on category theoretic models of guarded recursion, and so people with skills in the area of category theoretic models of type theory are also encouraged to apply. Those interested in the post doc should contact me via email as soon as possible. Best wishes, Rasmus Mogelberg
[TYPES/announce] Fully funded PhD scholarship at the IT University of Copenhagen
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Dear all, As part of the research project Type Theories for Reactive Programming funded by Villum Fonden, I have an opening for a fully funded PhD scholarship at the IT University of Copenhagen starting September 1, 2016. The aim of the project is to construct a type theory for programming and reasoning about reactive systems, using modalities to encode productivity. The design of the type theory will be based on denotational models, so the ideal candidate will have knowledge of category theory and type theory, but this is not a strict requirement. Further details on the project and how to apply can be found here: http://tinyurl.com/j77se64 Feel free also to contact me directly for further details. Over the next few years, I will have openings for one more PhD and two post docs on the same project. Best wishes, Rasmus Møgelberg
[TYPES/announce] Post doc available at the IT University of Copenhagen
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Dear all, I have recently received a grant from the Danish Council for Independent Research to hire a post doc to work on guarded recursive types in type theory. Ideally, I would like to find someone who has both knowledge of categorical models of type theory and practical experience with proof assistants. The job is initially for one year, but with the possibility of extension for another two. Those interested should contact me. More details can be found here: https://delta.hr-manager.net/ApplicationInit.aspx?cid=119departmentId=3439ProjectId=180662MediaId=5 Rasmus Mogelberg
