Research

Items by Heijltjes, Willem

Up a level
Export as [feed] RSS 1.0 [feed] Atom [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 8.

Book Sections

Heijltjes, W. and Hughes, D., 2015. Forthcoming. Complexity bounds for sum-product logic : via additive proof nets and Petri nets. In: Proceedings of the 30th IEEE/ACM Symposium on Logic in Computer Science. .

Heijltjes, W. and Houston, R., 2014. No proof nets for MLL with units:Proof equivalence in MLL is PSPACE-complete. In: Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic, CSL 2014 and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2014. New York: ACM.

Gundersen, T., Heijltjes, W. and Parigot, M., 2013. Atomic lambda-calculus:A typed lambda-calculus with explicit sharing. In: Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, pp. 311-320.

Gundersen, T., Heijltjes, W. and Parigot, M., 2013. A proof of strong normalisation of the typed atomic lambda-calculus. In: Logic for Programming, Artificial Intelligence, and Reasoning (LPAR). Heidelberg, Germany: Springer, pp. 340-354. (Lecture Notes in Computer Science; 8312)

Heijltjes, W., 2011. Proof nets for additive linear logic with units. In: 2011 26th Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE, pp. 207-216.

Articles

Heijltjes, W. and Strassburger, L., 2015. Forthcoming. Proof nets and semi-*-autonomous categories. Mathematical Structures in Computer Science

Heijltjes, W., 2010. Classical proof forestry. Annals of Pure and Applied Logic, 161 (11), 1346–1366.

Thesis

Heijltjes, W., 2012. Graphical Representation of Canonical Proof: Two Case Studies. Thesis (Doctor of Philosophy (PhD)). University of Edinburgh.

This list was generated on Sun Jul 5 07:03:43 2015 IST.