论文信息 - Tractable Constraints in Finite Semilattices - 字舞流文

Tractable Constraints in Finite Semilattices

time algorithms for testing the satissability of propositional horn formulae. 21. Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value-calculus using a stack of regions.

Torben Æ. Mogensen | W. F. Dowling | F. Henglein | Dirk Dussart | Jakob Rehof

[1] Chen C. Chang,et al. Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[2] Gary A. Kildall,et al. A unified approach to global program optimization , 1973, POPL.

[3] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[4] Brian A. Davey,et al. An Introduction to Lattices and Order , 1989 .

[5] Lars Birkedal,et al. Binding-time analysis for Standard ML , 1994, LISP Symb. Comput..

[6] Mads Tofte,et al. Implementation of the typed call-by-value λ-calculus using a stack of regions , 1994, POPL '94.

[7] Martin C. Cooper,et al. Tractable Constraints on Ordered Domains , 1995, Artif. Intell..

[8] Peter Jeavons,et al. An Algebraic Characterization of Tractable Constraints , 1995, COCOON.

[9] Fritz Henglein,et al. Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time , 1995, SAS.

[10] Lars Birkedal,et al. From region inference to von Neumann machines via region representation inference , 1996, POPL '96.