research-article

Open access

Intrinsically-typed definitional interpreters for linear, session-typed languages

Authors:

Casper Bach Poulsen,

Robbert Krebbers,

Eelco VisserAuthors Info & Claims

CPP 2020: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs

Pages 284 - 298

https://doi.org/10.1145/3372885.3373818

Published: 22 January 2020 Publication History

Abstract

An intrinsically-typed definitional interpreter is a concise specification of dynamic semantics, that is executable and type safe by construction. Unfortunately, scaling intrinsically-typed definitional interpreters to more complicated object languages often results in definitions that are cluttered with manual proof work. For linearly-typed languages (including session-typed languages) one has to prove that the interpreter, as well as all the operations on semantic components, treat values linearly. We present new methods and tools that make it possible to implement intrinsically-typed definitional interpreters for linearly-typed languages in a way that hides the majority of the manual proof work. Inspired by separation logic, we develop reusable and composable abstractions for programming with linear operations using dependent types. Using these abstractions, we define interpreters for linear lambda calculi with strong references, concurrency, and session-typed communication in Agda.

References

[1]

Andreas Abel and James Chapman. 2014. Normalization by evaluation in the delay monad: A case study for coinduction via copatterns and sized types. In MSFP (EPTCS), Vol. 153. 51-67.

[2]

Andreas Abel and Nicolai Kraus. 2011. A lambda term representation inspired by linear ordered logic. In LFMTP (EPTCS), Vol. 71. 1-13.

[3]

Guillaume Allais, James Chapman, Conor McBride, and James McKinna. 2017. Type-and-scope safe programs and their proofs. In CPP. 195-207.

Digital Library

[4]

Thorsten Altenkirch, James Chapman, and Tarmo Uustalu. 2015. Monads need not be endofunctors. LMCS 11, 1 (2015).

[5]

Nada Amin and Tiark Rompf. 2017. Type soundness proofs with definitional interpreters. In POPL. 666-679.

Digital Library

[6]

Casper Bach Poulsen, Arjen Rouvoet, Andrew Tolmach, Robbert Krebbers, and Eelco Visser. 2018. Intrinsically-typed definitional interpreters for imperative languages. PACMPL 2, POPL (2018), 16:1-16:34.

Digital Library

[7]

Richard Bornat, Cristiano Calcagno, Peter W. O'Hearn, and Matthew J. Parkinson. 2005. Permission accounting in separation logic. In POPL. 259-270.

Digital Library

[8]

Cristiano Calcagno, Peter W. O'Hearn, and Hongseok Yang. 2007. Local action and abstract separation logic. In LICS. 366-378.

Digital Library

[9]

Venanzio Capretta. 2005. General recursion via coinductive types. LMCS 1, 2 (2005).

[10]

Jesper Cockx. 2017. Dependent pattern matching and proof-relevant unification. Ph.D. Dissertation. Katholieke Universiteit Leuven.

[11]

Jesper Cockx and Andreas Abel. 2016. Sprinkles of extensionality for your vanilla type theory. Abstract of a talk at TYPES (2016).

[12]

Thierry Coquand. 1992. Pattern matching with dependent types. In Informal proceedings of Logical Frameworks, Vol. 92. 66-79.

[13]

Nils Anders Danielsson. 2018. Up-to techniques using sized types. PACMPL 2, POPL (2018), 43:1-43:28.

Digital Library

[14]

Robert Dockins, Aquinas Hobor, and Andrew W. Appel. 2009. A fresh look at separation algebras and share accounting. In APLAS (LNCS), Vol. 5904. 161-177.

Digital Library

[15]

Matthias Felleisen and Daniel P. Friedman. 1987. Control operators, the SECD-machine, and the ?-calculus. In Formal Description of Programming Concepts. 193-222.

[16]

Simon Fowler, Sam Lindley, J. Garrett Morris, and Sára Decova. 2019. Exceptional asynchronous session types: Session types without tiers. PACMPL 3, POPL (2019), 28:1-28:29.

Digital Library

[17]

Simon J. Gay and Vasco T. Vasconcelos. 2010. Linear type theory for asynchronous session types. JFP 20, 1 (2010), 19-50.

Digital Library

[18]

Peter Hancock and Anton Setzer. 2000. Interactive programs in dependent type theory. In CSL (LNCS), Vol. 1862. 317-331.

Digital Library

[19]

Jonas Kastberg Hinrichsen, Jesper Bengtson, and Robbert Krebbers. 2020. Actris: Session-type based reasoning in separation logic. PACMPL 4, POPL (2020), 6:1-6:30.

Digital Library

[20]

Ralf Jung, Jacques-Henri Jourdan, Robbert Krebbers, and Derek Dreyer. 2018. RustBelt: Securing the foundations of the Rust programming language. PACMPL 2, POPL (2018), 66:1-66:34.

Digital Library

[21]

Ralf Jung, Robbert Krebbers, Jacques-Henri Jourdan, Ales Bizjak, Lars Birkedal, and Derek Dreyer. 2018. Iris from the ground up: A modular foundation for higher-order concurrent separation logic. JFP 28 (2018), e20.

[22]

Ralf Jung, David Swasey, Filip Sieczkowski, Kasper Svendsen, Aaron Turon, Lars Birkedal, and Derek Dreyer. 2015. Iris: Monoids and invariants as an orthogonal basis for concurrent reasoning. In POPL. 637-650.

Digital Library

[23]

Anders Kock. 1972. Strong functors and monoidal monads. Archiv der Mathematik 23, 1 (1972), 113-120.

[24]

Robbert Krebbers. 2015. The C standard formalized in Coq. Ph.D. Dissertation. Radboud University Nijmegen.

[25]

Robbert Krebbers, Amin Timany, and Lars Birkedal. 2017. Interactive proofs in higher-order concurrent separation logic. In POPL. 205-217.

Digital Library

[26]

Conor McBride. 2018. Everybody's got to be somewhere. In MSFP (EPTCS), Vol. 275. 53-69.

[27]

Eugenio Moggi. 1991. Notions of computation and monads. Information and Computation 93, 1 (1991), 55-92.

Digital Library

[28]

Ulf Norell. 2009. Dependently typed programming in Agda. In TLDI. 1-2.

Digital Library

[29]

Peter W. O'Hearn and David J. Pym. 1999. The logic of bunched implications. Bulletin of Symbolic Logic 5, 2 (1999), 215-244.

Cited By

Zackon DSano CMomigliano APientka BStark KTimany ABlazy STabareau N(2025)Split Decisions: Explicit Contexts for Substructural LanguagesProceedings of the 14th ACM SIGPLAN International Conference on Certified Programs and Proofs10.1145/3703595.3705888(257-271)Online publication date: 10-Jan-2025
https://dl.acm.org/doi/10.1145/3703595.3705888
Carnier DPottier FKeuchel S(2024)Type Inference LogicsProceedings of the ACM on Programming Languages10.1145/36897868:OOPSLA2(2125-2155)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689786
Saffrich HThiemann PWeidner MAlves SCockx J(2024)Intrinsically Typed Syntax, a Logical Relation, and the Scourge of the Transfer LemmaProceedings of the 9th ACM SIGPLAN International Workshop on Type-Driven Development10.1145/3678000.3678201(2-15)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1145/3678000.3678201
Show More Cited By

Index Terms

Intrinsically-typed definitional interpreters for linear, session-typed languages
1. Software and its engineering
  1. Software notations and tools
    1. Formal language definitions
      1. Semantics
      2. Syntax
    2. General programming languages
      1. Language features
        Concurrent programming structures
2. Theory of computation
  1. Logic
    1. Separation logic

Recommendations

Intrinsically-typed definitional interpreters à la carte

Specifying and mechanically verifying type safe programming languages requires significant effort. This effort can in theory be reduced by defining and reusing pre-verified, modular components. In practice, however, existing approaches to modular ...
Intrinsically typed compilation with nameless labels

To avoid compilation errors it is desirable to verify that a compiler is type correct—i.e., given well-typed source code, it always outputs well-typed target code. This can be done intrinsically by implementing it as a function in a dependently typed ...
Intrinsically-typed definitional interpreters for imperative languages

A definitional interpreter defines the semantics of an object language in terms of the (well-known) semantics of a host language, enabling understanding and validation of the semantics through execution. Combining a definitional interpreter with a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CPP 2020: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs

January 2020

381 pages

ISBN:9781450370974

DOI:10.1145/3372885

Program Chairs:
Jasmin Blanchette
Universiteit Amsterdam, Netherlands
,
Cătălin Hriţcu
Inria, France

Copyright © 2020 Owner/Author.

This work is licensed under a Creative Commons Attribution International 4.0 License.

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

In-Cooperation

SIGLOG: ACM Special Interest Group on Logic and Computation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 January 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

POPL '20

Sponsor:

SIGPLAN

POPL '20: 47th Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 20 - 21, 2020

LA, New Orleans, USA

Acceptance Rates

Overall Acceptance Rate 18 of 26 submissions, 69%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
857
Total Downloads

Downloads (Last 12 months)181
Downloads (Last 6 weeks)28

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zackon DSano CMomigliano APientka BStark KTimany ABlazy STabareau N(2025)Split Decisions: Explicit Contexts for Substructural LanguagesProceedings of the 14th ACM SIGPLAN International Conference on Certified Programs and Proofs10.1145/3703595.3705888(257-271)Online publication date: 10-Jan-2025
https://dl.acm.org/doi/10.1145/3703595.3705888
Carnier DPottier FKeuchel S(2024)Type Inference LogicsProceedings of the ACM on Programming Languages10.1145/36897868:OOPSLA2(2125-2155)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689786
Saffrich HThiemann PWeidner MAlves SCockx J(2024)Intrinsically Typed Syntax, a Logical Relation, and the Scourge of the Transfer LemmaProceedings of the 9th ACM SIGPLAN International Workshop on Type-Driven Development10.1145/3678000.3678201(2-15)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1145/3678000.3678201
Jacobs JHinrichsen JKrebbers R(2024)Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message PassingProceedings of the ACM on Programming Languages10.1145/36328898:POPL(1385-1417)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632889
Galasso SCimini M(2024)Language-parameterized Proofs for Functional Languages with SubtypingFunctional and Logic Programming10.1007/978-981-97-2300-3_15(291-310)Online publication date: 15-May-2024
https://dl.acm.org/doi/10.1007/978-981-97-2300-3_15
Carbone MCastro-Perez DFerreira FGheri LJacobsen FMomigliano APadovani LScalas ATirore DVassor MYoshida NZackon D(2024)The Concurrent Calculi Formalisation BenchmarkCoordination Models and Languages10.1007/978-3-031-62697-5_9(149-158)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1007/978-3-031-62697-5_9
Jacobs JHinrichsen JKrebbers R(2023)Dependent Session Protocols in Separation Logic from First Principles (Functional Pearl)Proceedings of the ACM on Programming Languages10.1145/36078567:ICFP(768-795)Online publication date: 31-Aug-2023
https://dl.acm.org/doi/10.1145/3607856
Cimini MFischer BBurgueño LCazzola W(2022)Lang-n-Prove: A DSL for Language ProofsProceedings of the 15th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3567512.3567514(16-29)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3567512.3567514
Jacobs JBalzer SKrebbers R(2022)Multiparty GV: functional multiparty session types with certified deadlock freedomProceedings of the ACM on Programming Languages10.1145/35476386:ICFP(466-495)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3547638
Jacobs JBalzer SKrebbers R(2022)Connectivity graphs: a method for proving deadlock freedom based on separation logicProceedings of the ACM on Programming Languages10.1145/34986626:POPL(1-33)Online publication date: 12-Jan-2022
https://dl.acm.org/doi/10.1145/3498662
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten