• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Functions as Session-Typed Processes

Cached

  • Download as a PDF

Download Links

  • [www-cgi.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu.]
  • [www-cgi.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.lb.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Bernardo Toninho , Luis Caires , Frank Pfenning
Citations:3 - 2 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Toninho_functionsas,
    author = {Bernardo Toninho and Luis Caires and Frank Pfenning},
    title = {Functions as Session-Typed Processes},
    year = {}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We study type-directed encodings of the simply-typed λ-calculus in a session-typed π-calculus. The translations proceed in two steps: standard embeddings of simply-typed λ-calculus in a linear λ-calculus, followed by a standard translation of linear natural deduction to linear sequent calculus. We have shown in prior work how to give a Curry-Howard interpretation of the proofs in the linear sequent calculus as π-calculus processes subject to a session type discipline. We show that the resulting translations induce sharing and copying parallel evaluation strategies for the original λ-terms, thereby providing a new logically motivated explanation for these strategies.

Citations

409 Multilisp: A language for concurrent symbolic computation - Halstead - 1985
367 The ⇡-calculus: A Theory of Mobile Processes - Sangiorgi, Walker - 2001
290 Functions as processes - Milner - 1992
162 Language primitives and type disciplines for structured communication-based programming - Honda, Vasconcelos, et al. - 1998
149 Interaction Nets - Lafont - 1990
107 An algorithm for optimal lambda calculus reduction - Lamping - 1990
105 Semantics and Pragmatics of the Lambda Calculus - Wadsworth - 1971
93 The geometry of optimal lambda reduction - Gonthier, Abadi, et al. - 1992
79 Dual intuitionistic linear logic - Barber - 1996
75 A taste of linear logic - Wadler - 1993
33 On the Expressiveness of Internal Mobility in Name-Passing Calculi - Boreale - 1998
26 Call-by-name, call-byvalue, call-by-need, and the linear lambda calculus - Maraist, Odersky, et al. - 1995
19 Sequentiality and the pi-calculus - Berger, Honda, et al. - 2001
12 The lambda calculus with multiplicities - Boudol - 1993
12 Session Types as Intuitionistic Linear Propositions - Caires, Pfenning - 2010
8 Internal Mobility, and Agent Passing Calculi - Pi-Calculus - 1996
7 An exact correspondence between a typed pi-calculus and polarised proof-nets - Honda, Laurent
6 F.: Dependent session types via intuitionistic linear type theory - Toninho, Caires, et al. - 2011
4 Ludics is a model for the finitary linear pi-calculus - Faggian, Piccolo - 2007
4 Multiport Interaction Nets and Concurrency - Mazza - 2005
4 A logical interpretation of the λ-calculus into the πcalculus, preserving spine reduction and types - Bakel, Vigliotti - 2009
1 Functions as proofs as processes. CoRR, abs/1107.4160, 2011. as Session-Typed Processes 15 - Beffara - 2001
1 Functions as proofs as processes - Beffara
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University