A typed pattern calculus
From MaRDI portal
Publication:1908354
DOI10.1006/INCO.1996.0004zbMATH Open0844.68021OpenAlexW2145044561MaRDI QIDQ1908354FDOQ1908354
Delia Kesner, Laurence Puel, Val Tannen
Publication date: 27 March 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2368d236374d5333983df34d8b5954e496e38f1d
Cited In (10)
- Intermediate representation of programs with type specification based on pattern matching
- Function definition in higher-order logic
- Expression reduction systems with patterns
- Strong normalisation in two Pure Pattern Type Systems
- Pattern matching as cut elimination
- Rewriting calculus with(out) types
- Recursive Functions with Pattern Matching in Interaction Nets
- From functional programs to interaction nets via the rewriting calculus
- Title not available (Why is that?)
- Pattern-based calculi with finitary matching
Recommendations
- Type-safe pattern combinators 👍 👎
- Programming Languages and Systems 👍 👎
- A concurrent pattern calculus 👍 👎
- Pure patterns type systems 👍 👎
- A typed context calculus 👍 👎
- Relational and Kleene-Algebraic Methods in Computer Science 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: A typed pattern calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908354)
