Axiomatizing the Quote. - Andrew Polonsky (CSL, 2011)

Infinitary Rewriting Coinductively. - Jörg Endrullis; Andrew Polonsky (TYPES, 2011)

The range property fails for H. - Andrew Polonsky (J. Symb. Log., 2012)

Clocks for Functional Programs. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Andrew Polonsky (The Beauty of Functional Code, 2013)

An Ontology of States. - Andrew Polonsky; Henk Barendregt (The Beauty of Functional Code, 2013)

A Coinductive Treatment of Infinitary Rewriting. - Jörg Endrullis; Helle Hvid Hansen; Dimitri Hendriks; Andrew Polonsky; Alexandra Silva 001 (CoRR, 2013)

Extensionality of lambda-*. - Andrew Polonsky (TYPES, 2014)

An Introduction to the Clocked Lambda Calculus. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Andrew Polonsky (CoRR, 2014)

Internalization of extensional equality. - Andrew Polonsky (CoRR, 2014)

Discriminating Lambda-Terms Using Clocked Boehm Trees - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Andrew Polonsky (Log. Methods Comput. Sci., 2014)

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning. - Jörg Endrullis; Helle Hvid Hansen; Dimitri Hendriks; Andrew Polonsky; Alexandra Silva 001 (RTA, 2015)

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (Extended Version). - Jörg Endrullis; Helle Hvid Hansen; Dimitri Hendriks; Andrew Polonsky; Alexandra Silva 001 (CoRR, 2015)

New Results on Morris's Observational Theory: The Benefits of Separating the Inseparable. - Flavien Breuvart; Giulio Manzonetto; Andrew Polonsky; Domenico Ruoppolo (FSCD, 2016)

Refutation of Sallé's Longstanding Conjecture. - Benedetto Intrigila; Giulio Manzonetto; Andrew Polonsky (FSCD, 2017)

Clocked lambda calculus. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Andrew Polonsky (Math. Struct. Comput. Sci., 2017)

On local presentability of T/A. - Patricia Johann; Andrew Polonsky (CoRR, 2018)

On (weak) fpc generators. - Andrew Polonsky (CoRR, 2018)

Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic. - Jörg Endrullis; Helle Hvid Hansen; Dimitri Hendriks; Andrew Polonsky; Alexandra Silva 001 (Log. Methods Comput. Sci., 2018)

Higher-Kinded Data Types: Syntax and Semantics. - Patricia Johann; Andrew Polonsky (LICS, 2019)

Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture. - Benedetto Intrigila; Giulio Manzonetto; Andrew Polonsky (Log. Methods Comput. Sci., 2019)

The fixed point property and a technique to harness double fixed point combinators. - Giulio Manzonetto; Andrew Polonsky; Alexis Saurin; Jakob Grue Simonsen (J. Log. Comput., 2019)

Deep Induction: Induction Rules for (Truly) Nested Types. - Patricia Johann; Andrew Polonsky (FoSSaCS, 2020)

Local Presentability of Certain Comma Categories. - Andrew Polonsky; Patricia Johann (Appl. Categorical Struct., 2020)

Fixed point combinators as fixed points of higher-order fixed point generators. - Andrew Polonsky (Log. Methods Comput. Sci., 2020)

On sets of terms having a given intersection type. - Andrew Polonsky; Richard Statman (Log. Methods Comput. Sci., 2022)

ThermoPore: Predicting Part Porosity Based on Thermal Images Using Deep Learning. - Peter Myung-Won Pak; Francis Ogoke; Andrew Polonsky; Anthony Garland; Dan S. Bolintineanu; Dan R. Moser; Michael J. Heiden; Amir Barati Farimani (CoRR, 2024)