Amanote Research

Amanote Research

    RegisterSign In

Recursive Equivalence Types and Octahedra

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
doi 10.1017/s1446788700019790
Full Text
Open PDF
Abstract

Available in full text

Date

February 1, 1983

Authors
J. C. E. Dekker
Publisher

Cambridge University Press (CUP)


Related search

On the Equivalence of Recursive and Nonrecursive Datalog Programs

1992English

A Formalism for Treating Equivalence of Recursive Procedures

RAIRO. Informatique théorique
1985English

Recursive Polymorphic Types and Parametricity in an Operational Framework

English

An Operational Domain-Theoretic Treatment of Recursive Types

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2013English

Realisability Semantics of Parametric Polymorphism, General References and Recursive Types

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2010English

Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

A Complete Type Inference System for Subtyped Recursive Types

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Fully Generic Programming Over Closed Universes of Inductive-Recursive Types

English

Orbit Equivalence Types of Circle Diffeomorphisms With a Liouville Rotation Number

Nonlinearity
Nonlinear PhysicsApplied MathematicsMathematical PhysicsStatisticalAstronomyPhysics
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy