scientific article

From MaRDI portal

Revision as of 07:29, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3138832

Jump to:navigation, search

zbMath0790.03029MaRDI QIDQ3138832

Solomon Feferman

Publication date: 18 November 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

functional programming primitive recursive arithmetic implicit polymorphism

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) First-order arithmetic and fragments (03F30) General topics in the theory of software (68N01)

Related Items (8)

Formalizing non-termination of recursive programs ⋮ Theories with self-application and computational complexity. ⋮ Term rewriting theory for the primitive recursive functions ⋮ Proof-theoretic notions for software maintenance ⋮ Explicit mathematics: power types and overloading ⋮ Axioms for strict and lazy functional programs ⋮ Tiered Arithmetics ⋮ A flexible type system for the small Veblen ordinal

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3138832&oldid=16436037"