scientific article; zbMATH DE number 3874579

MaRDI QIDQ3340118zbMATH OpenFDO

Authors Alan Mycroft

Publication date 1984

zbMATH Keywords

polymorphic type systemrecursive top-level definitions

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Extending the type checker of Standard ML by polymorphic recursion
• Recursive types for Fun
• On Polymorphic Recursion, Type Systems, and Abstract Interpretation
• scientific article; zbMATH DE number 3907754
• scientific article; zbMATH DE number 1678377

Cited in

(36)

• Finitely stratified polymorphism
• Recursive types for Fun
• On the expressive power of finitely typed and universally polymorphic recursive procedures
• Type reconstruction in finite rank fragments of the second-order -calculus
• Strictness analysis via abstract interpretation for recursively defined types
• Extending the type checker of Standard ML by polymorphic recursion
• Semi-unification of two terms in Abelian groups
• Subtyping recursion and parametric polymorphism in kernel Fun
• Nested session types
• Safe typing of functional logic programs with opaque patterns and local bindings
• scientific article; zbMATH DE number 1678377 (Why is no real title available?)
• APLicative Programming with Naperian Functors
• Combining model checking and data-flow analysis
• A type system for well-founded recursion
• Lightweight family polymorphism
• On Polymorphic Recursion, Type Systems, and Abstract Interpretation
• Positive recursive type assignment
• Rank 2 intersection for recursive definitions
• scientific article; zbMATH DE number 3907754 (Why is no real title available?)
• Stratified polymorphism and primitive recursion
• scientific article; zbMATH DE number 2112161 (Why is no real title available?)
• Higher-ranked annotation polymorphic dependency analysis
• Introduction to Type Theory
• Intensional polymorphism in type-erasure semantics
• Programming Languages and Systems
• Programming Languages and Systems
• Typed Lambda Calculi and Applications
• A constraint-based region inference algorithm
• Calculating datastructures
• Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
• The different shades of infinite session types
• Reusing and modifying rulebases by predicate substitution
• Region-based memory management
• Interpretations of recursively defined types
• Undecidability of semi-unification on a napkin
• A principled approach to programming with nested types in Haskell

Describes a project that uses

Uses Software

• LCF

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340118)