Specifying type systems

DOI10.1007/3-540-61735-3_21MaRDI QIDQ2956732zbMATH OpenOpenAlexFDO

Authors Dieter Nazareth

Publication date 19 January 2017

Published in Algebraic and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61735-3_21

zbMATH Keywords

axiomatic specificationpolymorphic type systemqualified typestype inference

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Typing in pure type systems
• Type system in programming languages
• scientific article; zbMATH DE number 1088037
• scientific article; zbMATH DE number 512787
• Type inference for pure type systems
• scientific article; zbMATH DE number 1361534
• scientific article; zbMATH DE number 3900135
• scientific article; zbMATH DE number 711035
• Introduction to generalized type systems

Cited in

(10)

• scientific article; zbMATH DE number 1689578 (Why is no real title available?)
• Executable relational specifications of polymorphic type systems using Prolog
• The semantic treatment of polymorphic specification languages
• A Type System for Usage of Software Components
• Type structures
• Qualified Types
• Introduction to generalized type systems
• scientific article; zbMATH DE number 7301530 (Why is no real title available?)
• Classification of control of types in programs with complex data types
• Recent Advances in Constraints

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: Specifying type systems

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