Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-44602-7_13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Complexity of Normalization in the Pure Typed Lambda – Calculus

Studies in Logic and the Foundations of Mathematics
1982English

Continuity and Discontinuity in Lambda Calculus

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Solvability in Resource Lambda-Calculus

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Gödelisation in the Lambda-Calculus

BRICS Report Series
1995English

Storage Operators and Directed Lambda-Calculus

Journal of Symbolic Logic
PhilosophyLogic
1995English

Strong Normalization in a Typed Lambda Calculus With Lambda Structured Types

Studies in Logic and the Foundations of Mathematics
1994English

A Typed Lambda Calculus of Objects

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Algebras and Coalgebras in the Light Affine Lambda Calculus

2015English

A Lambda Calculus for Quantum Computation

SIAM Journal on Computing
MathematicsComputer Science
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy