Type Checking by Domain Analysis in Ampersand

DOI10.1007/978-3-319-24704-5_14MaRDI QIDQ3460627zbMATH OpenOpenAlexFDO

Authors Stef Joosten, Sebastiaan J. C. Joosten

Publication date 8 January 2016

Published in Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-24704-5_14

Mathematics Subject Classification ID

Cylindric and polyadic algebras; relation algebras (03G15) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• A semantics for type checking
• A denotational approach for type-checking in object-oriented programming languages
• Type inference, abstract interpretation and strictness analysis
• Type inference and strong static type checking for Promela
• scientific article; zbMATH DE number 3928328
• Checking algorithms for Pure Type Systems
• scientific article; zbMATH DE number 1500476
• scientific article; zbMATH DE number 1953279
• scientific article; zbMATH DE number 1948390

Cited in

(3)

• Relation algebra as programming language using the Ampersand compiler
• Software Development in Relation Algebra with Ampersand
• Translating three-variable first-order predicate logic to relation algebra, implemented using Z3

Describes a project that uses

Uses Software

• Haskell
• Ampersand

This page was built for publication: Type Checking by Domain Analysis in Ampersand

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