Calculating sized types
- 1 November 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 34 (11) , 62-72
- https://doi.org/10.1145/328690.328893
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Dependent types in practical programmingPublished by Association for Computing Machinery (ACM) ,1999
- Eliminating array bound checking through dependent typesPublished by Association for Computing Machinery (ACM) ,1998
- Proving the correctness of reactive systems using sized typesPublished by Association for Computing Machinery (ACM) ,1996
- Termination of logic programs: the never-ending storyThe Journal of Logic Programming, 1994
- A practical algorithm for exact array dependence analysisCommunications of the ACM, 1992
- Inference of inequality constraints in logic programs (extended abstracts)Published by Association for Computing Machinery (ACM) ,1991
- Termination detection in logic programs using argument sizes (extended abstract)Published by Association for Computing Machinery (ACM) ,1991
- Termination Proofs for Logic ProgramsPublished by Springer Nature ,1990
- Efficient tests for top-down termination of logical rulesJournal of the ACM, 1988
- Automatic discovery of linear restraints among variables of a programPublished by Association for Computing Machinery (ACM) ,1978