Induction and recursion on the partial real line with applications to Real PCF
type: Item
instance of: scholarly article
title: Induction and recursion on the partial real line with applications to Real PCF
zbMATH Open document ID: 0912.68123
DOI: 10.1016/S0304-3975(98)00099-1
author: Martín Escardo
author: Thomas Streicher
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 1238625
zbMATH Keywords: induction
zbMATH Keywords: coinduction
zbMATH Keywords: exact real number computation
zbMATH Keywords: domain theory
zbMATH Keywords: real PCF
zbMATH Keywords: universality
MaRDI profile type: Publication
cites work: Q4843177
cites work: Q4693062
cites work: A domain-theoretic approach to computability on the real line
cites work: Computability concepts for programming language semantics
cites work: Properly injective spaces and function spaces
cites work: Q4870818
cites work: PCF extended with real numbers
cites work: A coinduction principle for recursive data types based on bisimulation
cites work: Q3978971
cites work: Q3138538
cites work: Q3898534
cites work: Edinburgh LCF. A mechanized logic of computation
cites work: Q4288818
cites work: Q4190621
cites work: Algebraic specification of data types: A synthetic approach
cites work: Q5566070
cites work: LCF considered as a programming language
cites work: \(\mathbb{T}^\omega\) as a universal domain
cites work: Q4023900
cites work: Q3996430
cites work: Q5649639
cites work: A type-theoretical alternative to ISWIM, CUCH, OWHY
cites work: Effectively given domains
cites work: Q3316563
cites work: Q3138548
cites work: The Category-Theoretic Solution of Recursive Domain Equations
cites work: Q3851081
cites work: A universality theorem for PCF with recursive types, parallel-or and ∃
full work available at URL: s0304-3975(98)00099-1
OpenAlex ID: W2157014216
description: scientific article; zbMATH DE number 1238625