Indexed types

DOI10.1016/S0304-3975(97)00062-5zbMath0893.68086OpenAlexW2912293148MaRDI QIDQ1389626

Christoph Zenger

Publication date: 30 June 1998

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00062-5

zbMATH Keywords

functional languagesconstraintstype systemdependent typestype inference

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (6)

Dependently typed array programs don't go wrong ⋮ Size-based termination of higher-order rewriting ⋮ Computer algebra and artificial intelligence ⋮ Generic programming in 3D ⋮ Session Types with Arithmetic Refinements ⋮ QPCF: higher-order languages and quantum circuits

Uses Software

• AXIOM
• Coq
• ML
• Haskell
• Nuprl
• LEGO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polymorphic type system for Prolog
• Deforestation: Transforming programs to eliminate trees
• A theory of type polymorphism in programming
• An algorithm for type-checking dependent types
• Recursion Equations as a Programming Language
• Qualified Types

This page was built for publication: Indexed types