On the expressive power of finitely typed and universally polymorphic recursive procedures
From MaRDI portal
Publication:1185006
DOI10.1016/0304-3975(92)90210-7zbMath0755.68096OpenAlexW1986249546MaRDI QIDQ1185006
A. J. Kfoury, Jerzy Tiuryn, Paweł Urzyczyn
Publication date: 28 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(92)90210-7
Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)
Related Items (1)
Uses Software
Cites Work
- Necessary and sufficient conditions for the universality of programming formalisms
- Some relationships between logics of programs and complexity theory
- The IO- and OI-hierarchies
- On the expressive power of finitely typed and universally polymorphic recursive procedures
- On procedures as open subroutines. II
- LCF considered as a programming language
- IO and OI. II
- A theory of type polymorphism in programming
- A structural approach to operational semantics
- A necessary and sufficient condition in order that a Herbrand interpretation be expressive relative to recursive programs
- An automata-theoretical characterization of the OI-hierarchy
- Some open questions in the theory of program schemes and dynamic logics
- Program Schemes with Pushdown Stores
- On Classes of Program Schemata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the expressive power of finitely typed and universally polymorphic recursive procedures
