N-strictness in applicative theories

DOI10.1007/S001530050007zbMath0960.03050OpenAlexW1968312518MaRDI QIDQ1976882

Reinhard Kahle

Publication date: 14 May 2001

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530050007

zbMATH Keywords

inductionapplicative theoriesexplicit mathematicscombinatory algebraquantification operators

Mathematics Subject Classification ID

Metamathematics of constructive systems (03F50) Combinatory logic and lambda calculus (03B40)

Related Items (4)

Formalizing non-termination of recursive programs ⋮ Universes in explicit mathematics ⋮ Explicit mathematics: power types and overloading ⋮ TRUNCATION AND SEMI-DECIDABILITY NOTIONS IN APPLICATIVE THEORIES

This page was built for publication: N-strictness in applicative theories