Continuation models for the lambda calculus with constructors
From MaRDI portal
Publication:3178293
DOI10.1016/J.ENTCS.2012.10.001zbMATH Open1342.68053OpenAlexW2012491527WikidataQ113318055 ScholiaQ113318055MaRDI QIDQ3178293FDOQ3178293
Authors: Barbara Petit 
Publication date: 8 July 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2012.10.001
Recommendations
categorical semanticspattern matchinglambda calculuscontinuation modelcontinuation-passing-style transformation
Cites Work
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classical logic, continuation semantics and abstract machines
- Pattern Calculus
- The λ-calculus with constructors: Syntax, confluence and separation
- Programming Languages and Systems
- Combining higher-order and first-order computation using \(\rho\)-calculus: Towards a semantics of ELAN
- Semantics of typed lambda-calculus with constructors
- Confluence of Pattern-Based Calculi
Cited In (7)
- Enriching the lambda calculus with contexts: toward a theory of incremental program construction
- A Lambda-Calculus with Constructors
- A type system for continuation calculus
- Title not available (Why is that?)
- The λ-calculus with constructors: Syntax, confluence and separation
- Title not available (Why is that?)
- On constructor rewrite systems and the lambda calculus
This page was built for publication: Continuation models for the lambda calculus with constructors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178293)
