Amanote Research

Amanote Research

    RegisterSign In

An Operational Domain-Theoretic Treatment of Recursive Types

Mathematical Structures in Computer Science - United Kingdom
doi 10.1017/s0960129512001004
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsComputer Science Applications
Date

March 19, 2013

Authors
WENG KIN HO
Publisher

Cambridge University Press (CUP)


Related search

Recursive Polymorphic Types and Parametricity in an Operational Framework

English

Recursive Equivalence Types and Octahedra

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1983English

Domain-Theoretic Foundations of Functional Programming

2006English

Revised Operational Classification of Seizure Types

US Neurology
NeuroscienceNeurology
2017English

Recursive Method for Guaranteed Valuation of Options in Deterministic Game Theoretic Approach

SSRN Electronic Journal
2016English

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

Fully Generic Programming Over Closed Universes of Inductive-Recursive Types

English

A Complete Type Inference System for Subtyped Recursive Types

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy