scientific article; zbMATH DE number 1231477

MaRDI QIDQ4222780zbMATH OpenFDO

Authors Erik Barendsen, Sjaak Smetsers

Publication date 13 December 1998

Full work available at URL http://www.elsevier.com/cas/tree/store/tcs/free/noncas/pc/volume2.htm#barendsen

Mathematics Subject Classification ID

Theory of programming languages (68N15) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Uniqueness Typing Redefined
• Cogent: uniqueness types and certifying compilation
• scientific article; zbMATH DE number 969070
• An induction principle for pure type systems
• scientific article; zbMATH DE number 1301737
• Modelling unique and affine typing using polymorphism
• Type inference for pure type systems
• A higher-order unification algorithm for inductive types and dependent types
• Derivation and inference of higher-order strictness types

Cited in

(7)

• Uniqueness logic
• Uniqueness Typing Redefined
• Guaranteeing safe destructive updates through a type system with uniqueness information for graphs
• scientific article; zbMATH DE number 969070 (Why is no real title available?)
• Modelling unique and affine typing using polymorphism
• Linearity and uniqueness: an entente cordiale
• A concurrent lambda calculus with futures

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 Q4222780)