Inclusion constraints over non-empty sets of trees
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 345-356
- https://doi.org/10.1007/bfb0030609
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Solving systems of set constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Set constraints are the monadic classPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Set constraints with projections are in NEXPTIMEPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Negative set constraints with equalityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The independence property of a class of set constraintsPublished by Springer Nature ,1996
- Decidability of Systems of Set Constraints with Negative ConstraintsInformation and Computation, 1995
- Soft typing with conditional typesPublished by Association for Computing Machinery (ACM) ,1994
- Type inclusion constraints and type inferencePublished by Association for Computing Machinery (ACM) ,1993
- Equational problems anddisunificationJournal of Symbolic Computation, 1989
- The Type Free Lambda CalculusPublished by Elsevier ,1977