Complexity of Normalization in the Pure Typed Lambda – Calculus

Studies in Logic and the Foundations of Mathematics
doi 10.1016/s0049-237x(09)70143-0
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier

Related search

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

Proof Systems for Retracts in Simply Typed Lambda Calculus

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Gödelisation in the Lambda-Calculus

BRICS Report Series
1995English

Simply Typed Λ-Calculus

1993English

Towards Gradually Typed Capabilities in the Pi-Calculus

Electronic Proceedings in Theoretical Computer Science, EPTCS
Software
2019English

Solvability in Resource Lambda-Calculus

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Polyvariant Analysis of the Untyped Lambda Calculus

DAIMI Report Series
1992English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy