Bernardo Almeida, Andreia Mordido, Peter Thiemann & Vasco T. Vasconcelos (2021):
Polymorphic Context-free Session Types.
CoRR abs/2106.06658,
doi:10.48550/arXiv.2106.06658.
Bernardo Almeida, Andreia Mordido & Vasco T. Vasconcelos (2019):
FreeST, a Programming Language with Context-free Session Types.
http://rss.di.fc.ul.pt/tools/freest/.
Bernardo Almeida, Andreia Mordido & Vasco T. Vasconcelos (2019):
FreeST: Context-free Session Types in a Functional Language.
In: PLACES,
EPTCS 291,
pp. 12–23,
doi:10.4204/EPTCS.291.2.
Bernardo Almeida, Andreia Mordido & Vasco T. Vasconcelos (2020):
Deciding the Bisimilarity of Context-Free Session Types.
In: TACAS,
LNCS 12079.
Springer,
pp. 39–56,
doi:10.1007/978-3-030-45237-7_3.
Jos C. M. Baeten, Jan A. Bergstra & Jan Willem Klop (1987):
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages.
In: PARLE,
LNCS 259.
Springer,
pp. 94–111,
doi:10.1007/3-540-17945-3_5.
Jos C. M. Baeten, Jan A. Bergstra & Jan Willem Klop (1993):
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages.
J. ACM 40(3),
pp. 653–682,
doi:10.1145/174130.174141.
Olaf Burkart, Didier Caucal & Bernhard Steffen (1995):
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes.
In: MFCS,
LNCS 969.
Springer,
pp. 423–433,
doi:10.1007/3-540-60246-1_148.
Luís Caires, Jorge A. Pérez, Frank Pfenning & Bernardo Toninho (2013):
Behavioral Polymorphism and Parametricity in Session-Based Communication.
In: ESOP,
LNCS 7792.
Springer,
pp. 330–349,
doi:10.1007/978-3-642-37036-6_19.
Søren Christensen, Hans Hüttel & Colin Stirling (1995):
Bisimulation Equivalence is Decidable for All Context-Free Processes.
Inf. Comput. 121(2),
pp. 143–148,
doi:10.1006/inco.1995.1129.
Ornela Dardha, Elena Giachino & Davide Sangiorgi (2017):
Session types revisited.
Inf. Comput. 256,
pp. 253–286,
doi:10.1016/j.ic.2017.06.002.
Ankush Das, Henry DeYoung, Andreia Mordido & Frank Pfenning (2021):
Nested Session Types.
In: ESOP,
LNCS 12648.
Springer,
pp. 178–206,
doi:10.1007/978-3-030-72019-3_7.
Ankush Das, Henry DeYoung, Andreia Mordido & Frank Pfenning (2021):
Subtyping on Nested Polymorphic Session Types.
CoRR abs/2103.15193,
doi:10.48550/arXiv.2103.15193.
Nicolaas Govert De Bruijn (1972):
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem.
In: Indagationes Mathematicae 75.
Elsevier,
pp. 381–392,
doi:10.1016/1385-7258(72)90034-0.
Simon J. Gay (2008):
Bounded polymorphism in session types.
MSCS 18(5),
pp. 895–930,
doi:10.1017/S0960129508006944.
Simon J. Gay & Malcolm Hole (2005):
Subtyping for session types in the pi calculus.
Acta Informatica 42(2-3),
pp. 191–225,
doi:10.1007/s00236-005-0177-z.
Simon J. Gay, Diogo Poças & Vasco T. Vasconcelos (2022):
The Different Shades of Infinite Session Types.
CoRR abs/2201.08275,
doi:10.48550/arXiv.2201.08275.
Jean-Yves Girard (1971):
Une extension de L'interpretation de Gödel a L'analyse, et son application a L'elimination des coupures dans L'analyse et la theorie des types.
In: Studies in Logic and the Foundations of Mathematics 63.
Elsevier,
pp. 63–92,
doi:10.1016/S0049-237X(08)70843-7.
Sheila A. Greibach (1965):
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars.
J. ACM 12(1),
pp. 42–52,
doi:10.1145/321250.321254.
Dennis Edward Griffith (2016):
Polarized substructural session types.
University of Illinois at Urbana-Champaign,
doi:10.2172/1562827.
Yoram Hirshfeld, Mark Jerrum & Faron Moller (1996):
A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes.
Theor. Comput. Sci. 158(1&2),
pp. 143–159,
doi:10.1016/0304-3975(95)00064-X.
Kohei Honda (1993):
Types for Dyadic Interaction.
In: CONCUR,
LNCS 715.
Springer,
pp. 509–523,
doi:10.1007/3-540-57208-2_35.
Kohei Honda, Vasco Thudichum Vasconcelos & Makoto Kubo (1998):
Language Primitives and Type Discipline for Structured Communication-Based Programming.
In: ESOP,
LNCS 1381.
Springer,
pp. 122–138,
doi:10.1007/BFb0053567.
Petr Jančar (2012):
Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof).
Log. Methods Comput. Sci. 9(1),
doi:10.2168/LMCS-9(1:10)2013.
Stefan Kiefer (2013):
BPA bisimilarity is EXPTIME-hard.
Inf. Process. Lett. 113(4),
pp. 101–106,
doi:10.1016/j.ipl.2012.12.004.
A. J. Korenjak & John E. Hopcroft (1966):
Simple Deterministic Languages.
In: SWAT.
IEEE Computer Society,
pp. 36–46,
doi:10.1109/SWAT.1966.22.
Luca Padovani (2019):
Context-Free Session Type Inference.
ACM Trans. Program. Lang. Syst. 41(2),
pp. 9:1–9:37,
doi:10.1145/3229062.
Benjamin C. Pierce (2002):
Types and programming languages.
MIT Press.
Franz Puntigam (1999):
Non-regular Process Types.
In: Euro-Par,
LNCS 1685.
Springer,
pp. 1334–1343,
doi:10.1007/3-540-48311-X_189.
António Ravara & Vasco Thudichum Vasconcelos (1997):
Behavioural Types for a Calculus of Concurrent Objects.
In: Euro-Par,
LNCS 1300.
Springer,
pp. 554–561,
doi:10.1007/BFb0002782.
John C. Reynolds (1974):
Towards a theory of type structure.
In: Programming Symposium,
LNCS 19.
Springer,
pp. 408–423,
doi:10.1007/3-540-06859-7_148.
Davide Sangiorgi (2014):
An Introduction to Bisimulation and Coinduction.
Cambridge University Press.
Mario Südholt (2005):
A Model of Components with Non-regular Protocols.
In: SC,
LNCS 3628.
Springer,
pp. 99–113,
doi:10.1007/11550679_8.
Kaku Takeuchi, Kohei Honda & Makoto Kubo (1994):
An Interaction-based Language and its Typing System.
In: PARLE,
LNCS 817.
Springer,
pp. 398–413,
doi:10.1007/3-540-58184-7_118.
Peter Thiemann & Vasco T. Vasconcelos (2016):
Context-free session types.
In: ICFP.
ACM,
pp. 462–475,
doi:10.1145/2951913.2951926.
Philip Wadler (2012):
Propositions as sessions.
In: ICFP.
ACM,
pp. 273–286,
doi:10.1145/2364527.2364568.
eptcs@eptcs.org