Nominal Coalgebraic Data Types with Applications to Lambda Calculus

DOI10.2168/LMCS-9(4:20)2013zbMath1314.68189arXiv1311.1395OpenAlexW1990496572MaRDI QIDQ2871472

Daniela Petrişan, Fer-Jan de Vries, Paula G.Severi, Alexander Kurz

Publication date: 8 January 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.1395

zbMATH Keywords

coinductioncorecursionnominal setsinfinitary lambda calculus

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Categorical semantics of formal languages (18C50) Combinatory logic and lambda calculus (03B40)

Related Items (7)

Minimality Notions via Factorization Systems and Examples ⋮ Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets ⋮ A Light Modality for Recursion ⋮ Binding operators for nominal sets ⋮ A dependent type theory with abstractable names ⋮ Unnamed Item ⋮ A coalgebraic view on reachability

This page was built for publication: Nominal Coalgebraic Data Types with Applications to Lambda Calculus