Andrew Polonsky

According to our database, Andrew Polonsky authored at least 25 papers between 2011 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

On sets of terms having a given intersection type.

Andrew Polonsky, Richard Statman

Log. Methods Comput. Sci., 2022

2020

Fixed point combinators as fixed points of higher-order fixed point generators.

Andrew Polonsky

Log. Methods Comput. Sci., 2020

Local Presentability of Certain Comma Categories.

Andrew Polonsky, Patricia Johann

Appl. Categorical Struct., 2020

Deep Induction: Induction Rules for (Truly) Nested Types.

Patricia Johann, Andrew Polonsky

Proceedings of the Foundations of Software Science and Computation Structures, 2020

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

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

Higher-Kinded Data Types: Syntax and Semantics.

Patricia Johann, Andrew Polonsky

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018

Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic.

Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva

Log. Methods Comput. Sci., 2018

On (weak) fpc generators.

Andrew Polonsky

CoRR, 2018

On local presentability of T/A.

Patricia Johann, Andrew Polonsky

CoRR, 2018

2017

Clocked lambda calculus.

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky

Math. Struct. Comput. Sci., 2017

Refutation of Sallé's Longstanding Conjecture.

Benedetto Intrigila, Giulio Manzonetto, Andrew Polonsky

Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

2016

New Results on Morris's Observational Theory: The Benefits of Separating the Inseparable.

Flavien Breuvart, Giulio Manzonetto, Andrew Polonsky, Domenico Ruoppolo

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

2015

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (Extended Version).

Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva

CoRR, 2015

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning.

Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva

Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

2014

Discriminating Lambda-Terms Using Clocked Boehm Trees

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky

Log. Methods Comput. Sci., 2014

Internalization of extensional equality.

Andrew Polonsky

CoRR, 2014

An Introduction to the Clocked Lambda Calculus.

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky

CoRR, 2014

Extensionality of lambda-*.

Andrew Polonsky

Proceedings of the 20th International Conference on Types for Proofs and Programs, 2014

2013

A Coinductive Treatment of Infinitary Rewriting.

Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva

CoRR, 2013

An Ontology of States.

Andrew Polonsky, Henk Barendregt

Proceedings of the Beauty of Functional Code, 2013

Clocks for Functional Programs.

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky

Proceedings of the Beauty of Functional Code, 2013

2012

The range property fails for H.

Andrew Polonsky

J. Symb. Log., 2012

2011

Infinitary Rewriting Coinductively.

Jörg Endrullis, Andrew Polonsky

Proceedings of the 18th International Workshop on Types for Proofs and Programs, 2011

Axiomatizing the Quote.

Andrew Polonsky

Proceedings of the Computer Science Logic, 2011