Realizability interpretation of generalized inductive definitions
From MaRDI portal
Publication:1331920
DOI10.1016/0304-3975(94)90092-2zbMATH Open0801.03022OpenAlexW2051829567WikidataQ127957012 ScholiaQ127957012MaRDI QIDQ1331920FDOQ1331920
Authors: Satoshi Kobayashi, Makoto Tatsuta 
Publication date: 5 December 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90092-2
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cites Work
- Constructivism in mathematics. An introduction. Volume I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Constructive mathematics and computer programming
- Program synthesis using realizability
Cited In (7)
- Title not available (Why is that?)
- A convenient category of locally preordered spaces
- Monotone recursive definition of predicates and its realizability interpretation
- Generalized definitional reflection and the inversion principle
- A New Translation for Semi-classical Theories — Backtracking without CPS
- Realisability and adequacy for (co)induction
- Martin-Löf's type theory as an open-ended framework
Uses Software
This page was built for publication: Realizability interpretation of generalized inductive definitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1331920)
