Program specification and data refinement in type theory
From MaRDI portal
Publication:4282807
Recommendations
Cites work
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 3936465 (Why is no real title available?)
- scientific article; zbMATH DE number 44486 (Why is no real title available?)
- scientific article; zbMATH DE number 50149 (Why is no real title available?)
- A higher-order calculus and theory abstraction
- Do-it-yourself type theory
- Proof of correctness of data representations
- Specifications in an arbitrary institution
- Structured algebraic specifications: A kernel language
- The calculus of constructions
- The extended calculus of constructions (ECC) with inductive types
- Toward formal development of programs from algebraic specifications: Parameterisation revisited
- Type checking with universes
Cited in
(9)- scientific article; zbMATH DE number 1487738 (Why is no real title available?)
- scientific article; zbMATH DE number 4056978 (Why is no real title available?)
- Abstract Data Types and Type Theory: Theories as Types
- Circumscription in Data Logic for Data Type Specification
- Classification of control of types in programs with complex data types
- The metatheory of UTT
- A theory for program and data type specification
- scientific article; zbMATH DE number 1265030 (Why is no real title available?)
- Program derivation in type theory: A partitioning problem
This page was built for publication: Program specification and data refinement in type theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4282807)