×

Found 2 Documents (Results 1–2)

Complexity of subtype satisfiability over posets. (English) Zbl 1108.68407

Sagiv, Mooly (ed.), Programming languages and systems. 14th European symposium on programming, ESOP 2005, held as part of the joint European conferences on theory and practice of software, ETAPS 2005, Edinburgh, UK, April 4–8, 2005. Proceedings. Berlin: Springer (ISBN 3-540-25435-8/pbk). Lecture Notes in Computer Science 3444, 357-373 (2005).
MSC:  68N30
PDFBibTeX XMLCite
Full Text: DOI

The first-order theory of subtyping constraints. (English) Zbl 1323.68164

Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’02, Portland, OR, USA, January 16–18, 2002. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-450-9). 203-216 (2002).
MSC:  68N18 03B25 68N30
PDFBibTeX XMLCite
Full Text: DOI Link

Filter Results by …

Year of Publication

Main Field