Tractable constraints in finite semilattices
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 285-300
- https://doi.org/10.1007/3-540-61739-6_48
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- From region inference to von Neumann machines via region representation inferencePublished by Association for Computing Machinery (ACM) ,1996
- Tractable constraints on ordered domainsArtificial Intelligence, 1995
- Binding-time analysis for Standard MLHigher-Order and Symbolic Computation, 1995
- A unifying framework for tractable constraintsPublished by Springer Nature ,1995
- An algebraic characterization of tractable constraintsPublished by Springer Nature ,1995
- Efficient analyses for realistic off-line partial evaluationJournal of Functional Programming, 1993
- Structure identification in relational dataArtificial Intelligence, 1992
- Efficient type inference for higher-order binding-time analysisPublished by Springer Nature ,1991
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- A unified approach to global program optimizationPublished by Association for Computing Machinery (ACM) ,1973