Type-based termination of generic programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1223720 (Why is no real title available?)
- scientific article; zbMATH DE number 2100542 (Why is no real title available?)
- scientific article; zbMATH DE number 2111733 (Why is no real title available?)
- scientific article; zbMATH DE number 1424014 (Why is no real title available?)
- scientific article; zbMATH DE number 1424053 (Why is no real title available?)
- A new approach to generic functional programming
- Computer Science Logic
- Flexible type analysis
- Generalizing generalized tries
- Generic Haskell: applications.
- Generic Programming
- Implementation of Functional Languages
- Intensional polymorphism in type-erasure semantics
- Iteration and coiteration schemes for higher-order and nested datatypes
- Mathematics of Program Construction
- Polytypic values possess polykinded types
- Programming Languages and Systems
- Semi-continuous Sized Types and Termination
- Towards Generic Programming with Sized Types
- Type-based termination of recursive definitions
- Type-indexed data types
- Typed Lambda Calculi and Applications
- Types and programing languages
Cited in
(9)- Formal polytypic programs and proofs
- Type-Based Termination with Sized Products
- Towards Generic Programming with Sized Types
- Datatype-generic termination proofs
- Modular dependent induction in Coq, Mendler-style
- Logic Programming
- scientific article; zbMATH DE number 7649978 (Why is no real title available?)
- Semi-continuous Sized Types and Termination
- Dependent types for program termination verification
This page was built for publication: Type-based termination of generic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q923883)