×

Found 560 Documents (Results 1–100)

Finitely tractable promise constraint satisfaction problems. (English) Zbl 07724184

Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 11, 16 p. (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

What’s decidable about (atomic) polymorphism? (English) Zbl 07700632

Kobayashi, Naoki (ed.), 6th international conference on formal structures for computation and deduction, FSCD 2021, Buenos Aires, Argentina, virtual conference, July 17–24, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 195, Article 27, 23 p. (2021).
MSC:  68-XX 03B70 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Polymorphic automorphisms and the Picard group. (English) Zbl 07700631

Kobayashi, Naoki (ed.), 6th international conference on formal structures for computation and deduction, FSCD 2021, Buenos Aires, Argentina, virtual conference, July 17–24, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 195, Article 26, 17 p. (2021).
MSC:  68-XX 03B70 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Is impredicativity implicitly implicit? (English) Zbl 07756114

Bezem, Marc (ed.) et al., 25th international conference on types for proofs and programs. TYPES 2019, June 11–14, 2019, Oslo, Norway. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 175, Article 9, 19 p. (2020).
MSC:  03B40 68N18
PDFBibTeX XMLCite
Full Text: DOI

Equational logic and categorical semantics for multi-languages. (English) Zbl 07516372

Johann, Patricia (ed.), Proceedings of the 36th conference on mathematical foundations of programming semantics, MFPS XXXVI, virtual conference, June 2–6, 2020. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 352, 79-103 (2020).
MSC:  68N30 68Q55
PDFBibTeX XMLCite
Full Text: DOI

Syntactically restricting bounded polymorphism for decidable subtyping. (English) Zbl 1476.68041

Oliveira, Bruno C. d. S. (ed.), Programming languages and systems. 18th Asian symposium, APLAS 2020, Fukuoka, Japan, November 30 – December 2, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12470, 125-144 (2020).
MSC:  68N15 68N18 68N19
PDFBibTeX XMLCite
Full Text: DOI

Polymorphic higher-order termination. (English) Zbl 1528.68157

Geuvers, Herman (ed.), 4th international conference on formal structures for computation and deduction, FSCD 2019, Dortmund, Germany, June 24–30, 2019. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 131, Article 12, 18 p. (2019).
MSC:  68Q42 03B40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Algebraic approach to promise constraint satisfaction. (English) Zbl 1433.68271

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 602-613 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Certifying CPS transformation of let-polymorphic calculus using PHOAS. (English) Zbl 1519.68061

Ryu, Sukyoung (ed.), Programming languages and systems. 16th Asian symposium, APLAS 2018, Wellington, New Zealand, December 2–6, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11275, 375-393 (2018).
MSC:  68N30 68N18 68Q55
PDFBibTeX XMLCite
Full Text: DOI

Polymorphic success types for Erlang. (English) Zbl 1415.68056

Barthe, Gilles (ed.) et al., LPAR-22. 22nd international conference on logic for programming, artificial intelligence and reasoning, Awassa, Ethiopia, November 17–21, 2018. Selected papers. Manchester: EasyChair. EPiC Ser. Comput. 57, 515-533 (2018).
MSC:  68N15 68N18 68N19
PDFBibTeX XMLCite
Full Text: DOI

Efficient type checking for path polymorphism. (English) Zbl 1433.68094

Uustalu, Tarmo (ed.), 21st international conference on types for proofs and programs, TYPES 2015, May 18–21, 2015, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 69, Article 6, 23 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Constrained polymorphic types for a calculus with name variables. (English) Zbl 1433.68085

Uustalu, Tarmo (ed.), 21st international conference on types for proofs and programs, TYPES 2015, May 18–21, 2015, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 69, Article 4, 29 p. (2018).
MSC:  68N18
PDFBibTeX XMLCite
Full Text: DOI

An algebraic approach to valued constraint satisfaction. (English) Zbl 1440.68121

Goranko, Valentin (ed.) et al., 26th EACSL annual conference on computer science logic, CSL 2017, Stockholm, Sweden, August 20–24, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 82, Article 42, 20 p. (2017).
MSC:  68Q25 08A70 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Do be do be do. (English) Zbl 1380.68098

Castagna, Giuseppe (ed.) et al., Proceedings of the 44th annual ACM SIGPLAN symposium on principles of programming languages, POPL ’17, Paris, France, January 15–21, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4660-3). 500-514 (2017).
MSC:  68N18
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Polymorphism, subtyping, and type inference in MLsub. (English) Zbl 1380.68091

Castagna, Giuseppe (ed.) et al., Proceedings of the 44th annual ACM SIGPLAN symposium on principles of programming languages, POPL ’17, Paris, France, January 15–21, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4660-3). 60-72 (2017).
MSC:  68N18
PDFBibTeX XMLCite
Full Text: DOI Link

The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems. (English) Zbl 1401.68108

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 615-622 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Type soundness for path polymorphism. (English) Zbl 1390.68170

Benevides, Mario (ed.) et al., Proceedings of the 10th workshop on logical and semantic frameworks, with applications (LSFA 2015), Natal, Brazil, August 31 – September 1, 2015. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 323, 235-251 (2016).
MSC:  68N18 68P05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Category theory in Coq 8.5. (English) Zbl 1387.68208

Kesner, Delia (ed.) et al., 1st international conference on formal structures for computation and deduction, FSCD 2016, Porto, Portugal, June 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-010-1). LIPIcs – Leibniz International Proceedings in Informatics 52, Article 30, 18 p. (2016).
MSC:  68T15 03B15 03G30 18A99 55U40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fully abstract compilation via universal embedding. (English) Zbl 1361.68044

Garrigue, Jacques (ed.) et al., Proceedings of the 21st ACM SIGPLAN international conference on functional programming, ICFP ’16, Nara, Japan, September 18–22, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4219-3). 103-116 (2016).
MSC:  68N18 68N20 68Q55
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software