Context-Free Session Type Inference

DOI10.1007/978-3-662-54434-1_30zbMath1485.68072OpenAlexW2595410081MaRDI QIDQ2988669

Luca Padovani

Publication date: 19 May 2017

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54434-1_30

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Relating Functional and Imperative Session Types ⋮ The different shades of infinite session types ⋮ A simple library implementation of binary sessions ⋮ Context-Free Session Type Inference ⋮ Deciding the Bisimilarity of Context-Free Session Types ⋮ Polymorphic lambda calculus with context-free session types

Uses Software

• Haskell
• OCaml
• Alms

Cites Work

• Unnamed Item
• Unnamed Item
• Fundamental properties of infinite trees
• A syntactic approach to type soundness
• Session types revisited
• Propositions as sessions
• Context-free session types
• Context-Free Session Type Inference
• Full Abstraction in a Subtyped pi-Calculus with Linear Types
• Monadic encapsulation of effects: a revised approach (extended version)
• Stateful Contracts for Affine Types
• Concurrent Programming in ML
• On regions and linear types (extended abstract)
• Functional translation of a calculus of capabilities
• Linear type theory for asynchronous session types
• A simple library implementation of binary sessions
• Practical affine types
• Formal Methods at the Crossroads. From Panacea to Foundational Support

This page was built for publication: Context-Free Session Type Inference