Andrew Polonsky

According to our database1, Andrew Polonsky authored at least 26 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
ThermoPore: Predicting Part Porosity Based on Thermal Images Using Deep Learning.
CoRR, 2024

2022
On sets of terms having a given intersection type.
Log. Methods Comput. Sci., 2022

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

Local Presentability of Certain Comma Categories.
Appl. Categorical Struct., 2020

Deep Induction: Induction Rules for (Truly) Nested Types.
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.
J. Log. Comput., 2019

Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture.
Log. Methods Comput. Sci., 2019

Higher-Kinded Data Types: Syntax and Semantics.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018
Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic.
Log. Methods Comput. Sci., 2018

On (weak) fpc generators.
CoRR, 2018

On local presentability of T/A.
CoRR, 2018

2017
Clocked lambda calculus.
Math. Struct. Comput. Sci., 2017

Refutation of Sallé's Longstanding Conjecture.
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.
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).
CoRR, 2015

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

2014
Discriminating Lambda-Terms Using Clocked Boehm Trees
Log. Methods Comput. Sci., 2014

Internalization of extensional equality.
CoRR, 2014

An Introduction to the Clocked Lambda Calculus.
CoRR, 2014

Extensionality of lambda-*.
Proceedings of the 20th International Conference on Types for Proofs and Programs, 2014

2013
A Coinductive Treatment of Infinitary Rewriting.
CoRR, 2013

An Ontology of States.
Proceedings of the Beauty of Functional Code, 2013

Clocks for Functional Programs.
Proceedings of the Beauty of Functional Code, 2013

2012
The range property fails for H.
J. Symb. Log., 2012

2011
Infinitary Rewriting Coinductively.
Proceedings of the 18th International Workshop on Types for Proofs and Programs, 2011

Axiomatizing the Quote.
Proceedings of the Computer Science Logic, 2011


  Loading...