Recursion on Nested Datatypes in Dependent Type Theory

doi 10.1007/978-3-540-69407-6_47
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Syntax and Semantics in Higher-Type Recursion Theory

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1983English

Syntax and Semantics in Higher-Type Recursion Theory

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1983English

Composable, Sound Transformations of Nested Recursion and Loops

2019English

Book Review: Classical Recursion Theory

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
1993English

A Dependent Nominal Type Theory

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Book Review: Fundamentals of Generalized Recursion Theory

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
1985English

A Theory of Complexity of Monadic Recursion Schemes

RAIRO. Informatique théorique
1981English

Recursion and Double Recursion

Bulletin of the American Mathematical Society
1948English

1-Generic Degrees and Minimal Degrees in Higher Recursion Theory

Japanese Journal of Mathematics
Mathematics
1987English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy