Nested Datatypes with Generalized Mendler Iteration: Map Fusion and the Example of the Representation of Untyped Lambda Calculus with Explicit Flattening

DOI10.1007/978-3-540-70594-9_13zbMATH Open1156.68483OpenAlexW1579110349MaRDI QIDQ3521990FDOQ3521990

Authors: Ralph Matthes 

Publication date: 28 August 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70594-9_13

Recommendations

• Map fusion for nested datatypes in intensional type theory
• scientific article; zbMATH DE number 1956505
• Iteration and coiteration schemes for higher-order and nested datatypes
• An induction principle for nested datatypes in intensional type theory
• Recursion on Nested Datatypes in Dependent Type Theory

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65)

Cited In (10)

• Title not available (Why is that?)
• A hierarchy of Mendler style recursion combinators: taming inductive datatypes with negative occurrences
• Recursion on Nested Datatypes in Dependent Type Theory
• An induction principle for nested datatypes in intensional type theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Map fusion for nested datatypes in intensional type theory
• Nested abstract syntax in Coq
• Iteration and coiteration schemes for higher-order and nested datatypes
• Generalised folds for nested datatypes

Uses Software

• Coq

This page was built for publication: Nested Datatypes with Generalized Mendler Iteration: Map Fusion and the Example of the Representation of Untyped Lambda Calculus with Explicit Flattening

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521990)