Finiteness and rational sequences, constructively

DOI10.1017/S0956796817000041zbMath1418.68069OpenAlexW2604484875MaRDI QIDQ5372009

Niccolò Veltri, Tarmo Uustalu

Publication date: 23 October 2017

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796817000041

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Metamathematics of constructive systems (03F50)

Related Items (1)

Unnamed Item

Uses Software

• Agda

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamental properties of infinite trees
• Regular trees and the free iterative theory
• The existence and construction of free iterative theories
• On the algebraic structure of rooted trees
• A Mechanized Theory of Regular Trees in Dependent Type Theory
• On streams that are finitely red
• Dependently Typed Programming in Agda
• The Zipper
• Free iterative theories: a coalgebraic view
• Language Constructs for Non-Well-Founded Computation

This page was built for publication: Finiteness and rational sequences, constructively