Two algorithms in search of a type-system

DOI10.1007/s00224-009-9181-yzbMath1187.68308arXiv0710.0824OpenAlexW2041058737MaRDI QIDQ733753

James S. Royer, Norman Danner

Publication date: 19 October 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0710.0824

zbMATH Keywords

implicit computational complexitycompositional semanticsbasic feasible functionalshigher-type complexityhigher-type computation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Semantics in the theory of computing (68Q55) Theory of software (68N99)

Cites Work

• Functional interpretations of feasibly constructive arithmetic
• A new recursion-theoretic characterization of the polytime functions
• Linear types and non-size-increasing polynomial time computation.
• The expressive power of higher-order types or, life without CONS
• A new Characterization of Type-2 Feasibility
• The strength of non-size increasing computation
• Adventures in time and space
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two algorithms in search of a type-system