Pattern Calculus
From MaRDI portal
Publication:3629217
DOI10.1007/978-3-540-89185-7zbMath1215.68055OpenAlexW4250793500MaRDI QIDQ3629217
Publication date: 27 May 2009
Full work available at URL: https://doi.org/10.1007/978-3-540-89185-7
Searching and sorting (68P10) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05)
Related Items (14)
Self-quotation in a typed, intensional lambda-calculus ⋮ Continuation Models for the Lambda Calculus With Constructors ⋮ On the Expressiveness of Symmetric Communication ⋮ Expressiveness of concurrent intensionality ⋮ Typed path polymorphism ⋮ Unnamed Item ⋮ Pure pattern calculus à la de Bruijn ⋮ Intensional computation with higher-order functions ⋮ Programs as data structures in \(\lambda\)SF-calculus ⋮ Type soundness for path polymorphism ⋮ Conflicting accounts of \(\lambda\)-definability ⋮ On abstract normalisation beyond neededness ⋮ First-class patterns ⋮ Unnamed Item
Uses Software
This page was built for publication: Pattern Calculus
