Language and Proofs for Higher-Order SMT (Work in Progress)∗ Haniel Barbosa Jasmin Christian Blanchette

First Page		Document Content
Date: 2017-09-19 19:50:55 Theoretical computer science Mathematics Algebra Formal methods Logic in computer science Computability theory Models of computation Lambda calculus Satisfiability modulo theories -ring De Bruijn index		Language and Proofs for Higher-Order SMT (Work in Progress)∗ Haniel Barbosa Jasmin Christian Blanchette Add to Reading List Source URL: pxtp.github.io Download Document from Source Website File Size: 193,08 KB Share Document on Facebook

	135 Documenta Math. Erratum to the paper “Absolute Continuity of the Spectrum DocID: 1pRNp - View Document
	Self-applicable Partial Evaluation for Pure Lambda Calculus Torben Æ. Mogensen DIKU, University of Copenhagen, Denmark Abstract DocID: 1oZ9H - View Document
	Exercise sheet High Throughput Sequencing Methods Bioinformatics Leipzig WS 13/14 Exercise sheet DocID: 1fZS8 - View Document
	BRICS RS-05-4 Filinski & Rohde: Denotational Aspects of Untyped Normalization by Evaluation BRICS Basic Research in Computer Science DocID: 1fMbR - View Document
	Closing the Stage From Staged Code to Typed Closures Yukiyoshi Kameyama Oleg Kiselyov DocID: 1aOQt - View Document