-
2
-
-
84880003791
-
The complexity of set constraints
-
"1993 Conference on Computer Science Logic,"
-
Aiken, A., Kozen, D., Vardi, M., and Wimmers, E. L. (1993), The complexity of set constraints, in "1993 Conference on Computer Science Logic," Lecture Notes in Computer Science, Vol. 832, pp. 1-17.
-
(1993)
Lecture Notes in Computer Science
, vol.832
, pp. 1-17
-
-
Aiken, A.1
Kozen, D.2
Vardi, M.3
Wimmers, E.L.4
-
3
-
-
0002902902
-
Decidability of Systems of Set Constraints with Negative Constraints
-
Technical Report 93-1362, Computer Science Department, Cornell University
-
Aiken, A., Kozen, D., and Wimmers, E. L. (1993), "Decidability of Systems of Set Constraints with Negative Constraints," Technical Report 93-1362, Computer Science Department, Cornell University. [Inform. and Comput. 122, 30-44.]
-
(1993)
Inform. and Comput.
, vol.122
, pp. 30-44
-
-
Aiken, A.1
Kozen, D.2
Wimmers, E.L.3
-
7
-
-
0027870608
-
Type inclusion constraints and type inference
-
Copenhagen, Denmark
-
Aiken, A. and Wimmers, E. (1993), Type inclusion constraints and type inference, in "Proceedings of the 1993 Conference on Functional Programming Languages and Computer Architecture," pp. 31-41, Copenhagen, Denmark.
-
(1993)
Proceedings of the 1993 Conference on Functional Programming Languages and Computer Architecture
, pp. 31-41
-
-
Aiken, A.1
Wimmers, E.2
-
8
-
-
0028013810
-
Soft typing with conditional types
-
Portland, Oregon
-
Aiken, A., Wimmers, E., and Lakshman, T. K. (1994), Soft typing with conditional types, in "Twenty-First Annual ACM Symposium on Principles of Programming Languages," Portland, Oregon.
-
(1994)
Twenty-First Annual ACM Symposium on Principles of Programming Languages
-
-
Aiken, A.1
Wimmers, E.2
Lakshman, T.K.3
-
9
-
-
0027225011
-
Set constraints are the monadic class
-
Bachmair, L., Ganzinger, H., and Waldmann, U. (1993), Set constraints are the monadic class, in "Eighth Annual IEEE Symposium on Logic in Computer Science," pp. 75-83.
-
(1993)
Eighth Annual IEEE Symposium on Logic in Computer Science
, pp. 75-83
-
-
Bachmair, L.1
Ganzinger, H.2
Waldmann, U.3
-
13
-
-
0026882814
-
Decidable problems in shallow equational theories
-
Extended abstract
-
Comon, H., Haberstrau, M., and Jouannaud, J.-P. (1992), Decidable problems in shallow equational theories, in "Seventh Annual IEEE Symposium on Logic in Computer Science," pp. 255-265. [Extended abstract]
-
(1992)
Seventh Annual IEEE Symposium on Logic in Computer Science
, pp. 255-265
-
-
Comon, H.1
Haberstrau, M.2
Jouannaud, J.-P.3
-
14
-
-
0001383481
-
Syntactiness, cycle-syntacticness, and shallow theories
-
Comon, H., Haberstrau, M., and Jouannaud, J.-P. (1994), Syntactiness, cycle-syntacticness, and shallow theories, Inform. and Comput. 111, pp. 154-191.
-
(1994)
Inform. and Comput.
, vol.111
, pp. 154-191
-
-
Comon, H.1
Haberstrau, M.2
Jouannaud, J.-P.3
-
16
-
-
85027612131
-
Solving systems of set constraints using tree automata
-
"10th Annual Symposium on Theoretical Aspects of Computer Science," Springer-Verlag, Berlin/ New York
-
Gilleron, R., Tison, S., and Tommasi, M. (1993), Solving systems of set constraints using tree automata, in "10th Annual Symposium on Theoretical Aspects of Computer Science," Lecture Notes in Computer Science, Vol. 665, pp. 505-514, Springer-Verlag, Berlin/ New York.
-
(1993)
Lecture Notes in Computer Science
, vol.665
, pp. 505-514
-
-
Gilleron, R.1
Tison, S.2
Tommasi, M.3
-
17
-
-
0027884475
-
Solving systems of set constraints with negated subset relationships
-
Full version: Technical report IT 247, Laboratoire d'Informatique Fondamentale de Lille
-
Gilleron, R., Tison, S., and Tommasi, M. (1993), Solving systems of set constraints with negated subset relationships, in "Proceedings of the 34th Symp. on Foundations of Computer Science," pp. 372-380. [Full version: Technical report IT 247, Laboratoire d'Informatique Fondamentale de Lille]
-
(1993)
Proceedings of the 34th Symp. on Foundations of Computer Science
, pp. 372-380
-
-
Gilleron, R.1
Tison, S.2
Tommasi, M.3
-
18
-
-
0003721364
-
-
Ph.D. thesis, School of Computer Science, Carnegie Mellon University
-
Heintze, N. (1992), "Set Based Program Analysis," Ph.D. thesis, School of Computer Science, Carnegie Mellon University.
-
(1992)
Set Based Program Analysis
-
-
Heintze, N.1
-
19
-
-
0012193440
-
-
Technical report CS-93-221, School of Computer Science, Carnegie-Mellon University
-
Heintze, N. (1993), Set based analysis of arithmetic, Technical report CS-93-221, School of Computer Science, Carnegie-Mellon University.
-
(1993)
Set Based Analysis of Arithmetic
-
-
Heintze, N.1
-
22
-
-
0003620778
-
-
Addison-Wesley, Reading, MA
-
Hopcroft, J. E. and Ullmann, J. D. (1979), "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, Reading, MA.
-
(1979)
Introduction to Automata Theory, Languages, and Computation
-
-
Hopcroft, J.E.1
Ullmann, J.D.2
-
24
-
-
0012195180
-
Logical aspects of set constraints
-
"1993 Conference on Computer Science Logic,"
-
Kozen, D. (1993), Logical aspects of set constraints, in "1993 Conference on Computer Science Logic," Lecture Notes in Computer Science, Vol. 832, pp. 175-188.
-
(1993)
Lecture Notes in Computer Science
, vol.832
, pp. 175-188
-
-
Kozen, D.1
-
25
-
-
85028463746
-
Set constraints and logic programming
-
"1st International Conference Constraints in Computational Logics," Springer-Verlag, Berlin/New York
-
Kozen, D. (1994), Set constraints and logic programming, in "1st International Conference Constraints in Computational Logics," Lecture Notes in Computer Science, Vol. 845, Springer-Verlag, Berlin/New York. [Also in (1998), Inform. and Comput. 142, 2-25]
-
(1994)
Lecture Notes in Computer Science
, vol.845
-
-
Kozen, D.1
-
26
-
-
0346884932
-
-
Kozen, D. (1994), Set constraints and logic programming, in "1st International Conference Constraints in Computational Logics," Lecture Notes in Computer Science, Vol. 845, Springer-Verlag, Berlin/New York. [Also in (1998), Inform. and Comput. 142, 2-25]
-
(1998)
Inform. and Comput.
, vol.142
, pp. 2-25
-
-
-
27
-
-
0000195160
-
Complexity results for classes of quantificational formulas
-
Lewis H. R. (1980), Complexity results for classes of quantificational formulas, J. Comput. System Sci. 21, pp. 317-353.
-
(1980)
J. Comput. System Sci.
, vol.21
, pp. 317-353
-
-
Lewis, H.R.1
-
29
-
-
0001514506
-
Automatic computation of data set definitions
-
Reynolds, J. C. (1969), Automatic computation of data set definitions, Inform. Process. 68, pp. 456-461.
-
(1969)
Inform. Process.
, vol.68
, pp. 456-461
-
-
Reynolds, J.C.1
-
31
-
-
85029602329
-
Sorted unification using set constraints
-
"11th International Conference on Automated Deduction," Springer-Verlag, Berlin/New York
-
Uribe, T. E. (1992), Sorted unification using set constraints, in "11th International Conference on Automated Deduction," Lecture Notes in Artificial Intelligence, Vol. 607, pp. 163-177, Springer-Verlag, Berlin/New York.
-
(1992)
Lecture Notes in Artificial Intelligence
, vol.607
, pp. 163-177
-
-
Uribe, T.E.1
-
32
-
-
0012156609
-
Experience with a type evaluator
-
(D. Bjørner, A. P. Ershov, and N. D. Jones, Eds.), North-Holland, Amsterdam
-
Young, J. and O'Keefe, P. (1988), Experience with a type evaluator, in "Partial Evaluation and Mixed Computation" (D. Bjørner, A. P. Ershov, and N. D. Jones, Eds.), pp. 573-581, North-Holland, Amsterdam.
-
(1988)
Partial Evaluation and Mixed Computation
, pp. 573-581
-
-
Young, J.1
O'Keefe, P.2
|