TWO REALIZABILITY INTERPRETATIONS OF MONOTONE INDUCTIVE DEFINITIONS

DOI10.1142/S0129054194000025zbMath0802.03027OpenAlexW2037883337MaRDI QIDQ4304621

Makoto Tatsuta

Publication date: 12 December 1994

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054194000025

zbMATH Keywords

realizabilityconstructive logicconstructive proofsrecursive data structuresmonotone inductive definitionsconstructive programmingconductive definitionsrecursive control structures

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency

Uses Software

• Nuprl

This page was built for publication: TWO REALIZABILITY INTERPRETATIONS OF MONOTONE INDUCTIVE DEFINITIONS