Comparing Hagino's categorical programming language and typed lambda- calculi

DOI10.1016/0304-3975(93)90186-WzbMath0787.68014MaRDI QIDQ685425

Austin Melton, Hans Dybkjær

Publication date: 26 May 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

dialgebrasiteration over inductive typesnatural number functionsreduction rulessimply typed \(\lambda\)-calculustyped categorical programming language

Mathematics Subject Classification ID

Theory of programming languages (68N15) Applications of universal algebra in computer science (08A70) Semantics in the theory of computing (68Q55) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Two extensions of system F with (co)iteration and primitive (co)recursion principles

Uses Software

• Automath

Cites Work

• Automatic synthesis of typed \(\Lambda\)-programs on term algebras
• A note on categorical datatypes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparing Hagino's categorical programming language and typed lambda- calculi