Type-based termination of generic programs
From MaRDI portal
Publication:923883
DOI10.1016/j.scico.2008.01.004zbMath1192.68134MaRDI QIDQ923883
Publication date: 24 July 2009
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2008.01.004
68N18: Functional programming and lambda calculus
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polytypic values possess polykinded types
- Iteration and coiteration schemes for higher-order and nested datatypes
- Type-indexed data types
- Flexible type analysis
- Towards Generic Programming with Sized Types
- Type-based termination of recursive definitions
- Generalizing generalized tries
- Intensional polymorphism in type-erasure semantics
- A new approach to generic functional programming
- Generic Programming
- Generic Programming
- Mathematics of Program Construction
- Computer Science Logic
- Implementation of Functional Languages
- Programming Languages and Systems
- Typed Lambda Calculi and Applications
- Semi-continuous Sized Types and Termination