Recursive types for Fun

DOI10.1016/0304-3975(91)90038-4zbMath0746.68018OpenAlexW2001517412MaRDI QIDQ1176245

Felice Cardone

Publication date: 25 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90038-4

zbMATH Keywords

Funinterpretation of typestyped polymorphic lambda calculus

Mathematics Subject Classification ID

Theory of programming languages (68N15) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Recursion over realizability structures ⋮ Toward a semantics for the QUEST language ⋮ Combining type disciplines

Uses Software

• Smalltalk
• Simula 67

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extensional models for polymorphism
• The semantics of second-order lambda calculus
• Universal profinite domains
• A semantics of multiple inheritance
• Polymorphic type inference and containment
• Recursion over realizability structures
• An ideal model for recursive polymorphic types
• Type theories and object-oriented programmimg
• The Category-Theoretic Solution of Recursive Domain Equations
• A Powerdomain Construction
• Operations on records
• SIMULA: an ALGOL-based simulation language

This page was built for publication: Recursive types for Fun