Tarmo Uustalu

Niccolò Veltri

Proceedings of the Programming Languages and Systems - 15th Asian Symposium, 2017

2016

Guest editors' foreword.

[BibT_eX]

[DOI]

Jüri Vain

J. Log. Algebraic Methods Program., 2016

A divertimento on MonadPlus and nondeterminism.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2016

Variations on Noetherianness.

[BibT_eX]

[DOI]

Niccolò Veltri

Proceedings of the Proceedings 6th Workshop on Mathematically Structured Functional Programming, 2016

Directed Containers as Categories.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 6th Workshop on Mathematically Structured Functional Programming, 2016

Combining effects and coeffects via grading.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

A Coalgebraic View of Bar Recursion and Bar Induction.

[BibT_eX]

[DOI]

Venanzio Capretta

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

2015

Stateful Runners of Effectful Computations.

[BibT_eX]

[DOI]

Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

A Hoare logic for the coinductive trace-based big-step semantics of While.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2015

Monads need not be endofunctors.

[BibT_eX]

[DOI]

James Chapman

Log. Methods Comput. Sci., 2015

Dependently typed programming with finite sets.

[BibT_eX]

[DOI]

Proceedings of the 11th ACM SIGPLAN Workshop on Generic Programming, 2015

Certified Normalization of Context-Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the 2015 Conference on Certified Programs and Proofs, 2015

2014

Certified CYK parsing of context-free languages.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2014

Relative Monads Formalised.

[BibT_eX]

[DOI]

James Chapman

J. Formaliz. Reason., 2014

Coalgebraic Update Lenses.

[BibT_eX]

[DOI]

Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

Coherence for Skew-Monoidal Categories.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 5th Workshop on Mathematically Structured Functional Programming, 2014

When is a container a comonad?

[BibT_eX]

[DOI]

James Chapman

Log. Methods Comput. Sci., 2014

2013

Coinduction for Computation Structures and Programming Languages (NII Shonan Meeting 2013-11).

[BibT_eX]

[DOI]

Ichiro Hasuo

NII Shonan Meet. Rep., 2013

Preface.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2013

Coinductive Big-Step Semantics for Concurrency.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 6th Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, 2013

Update Monads: Cointerpreting Directed Containers.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Types for Proofs and Programs, 2013

Certified Parsing of Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Certified Programs and Proofs - Third International Conference, 2013

2012

On streams that are finitely red

[BibT_eX]

[DOI]

Marc Bezem

Log. Methods Comput. Sci., 2012

Structured general corecursion and coinductive graphs [extended abstract]

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th Workshop on Fixed Points in Computer Science, 2012

Explicit Binds: Effortless Efficiency with and without Trees.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012

2011

A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction.

[BibT_eX]

[DOI]

Marc Bezem

Proceedings of the Programming Languages and Systems - 9th Asian Symposium, 2011

2010

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Relating Sequent Calculi for Bi-intuitionistic Propositional Logic

[BibT_eX]

[DOI]

Luís Pinto

Proceedings of the Proceedings Third International Workshop on Classical Logic and Computation, 2010

Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction

[BibT_eX]

[DOI]

Proceedings of the Proceedings Seventh Workshop on Structural Operational Semantics, 2010

A Categorical Outlook on Cellular Automata.

[BibT_eX]

[DOI]

Silvio Capobianco

Proceedings of the Second Symposium on Cellular Automata "Journées Automates Cellulaires", 2010

Antifounded Coinduction in Type Theory.

[BibT_eX]

[DOI]

Proceedings of the Partiality and Recursion in Interactive Theorem Provers, 2010

A Note on Strong Dinaturality, Initial Algebras and Uniform Parameterized Fixpoint Operators.

[BibT_eX]

[DOI]

Proceedings of the 7th Workshop on Fixed Points in Computer Science, 2010

2009

Preface.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2009

Proof optimization for partial redundancy elimination.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2009

Preface.

[BibT_eX]

[DOI]

Conor McBride

J. Funct. Program., 2009

Trace-Based Coinductive Operational Semantics for While.

[BibT_eX]

[DOI]

Proceedings of the Theorem Proving in Higher Order Logics, 22nd International Conference, 2009

Program Repair as Sound Optimization of Broken Programs.

[BibT_eX]

[DOI]

Bernd Fischer

Proceedings of the TASE 2009, 2009

Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents.

[BibT_eX]

[DOI]

Luís Pinto

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2009

Corecursive Algebras: A Study of General Structured Corecursion.

[BibT_eX]

[DOI]

Venanzio Capretta

Proceedings of the Formal Methods: Foundations and Applications, 2009

Bidirectional data-flow analyses, type-systematically.

[BibT_eX]

[DOI]

Maria João Frade

Proceedings of the 2009 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, 2009

2008

Program and proof optimizations with type systems.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2008

The Recursion Scheme from the Cofree Recursive Comonad.

[BibT_eX]

[DOI]

Proceedings of the Second Workshop on Mathematically Structured Functional Programming, 2008

Comonadic Notions of Computation.

[BibT_eX]

[DOI]

Proceedings of the Ninth Workshop on Coalgebraic Methods in Computer Science, 2008

2007

Type Systems for Optimizing Stack-based Code.

[BibT_eX]

[DOI]

Proceedings of the Second Workshop on Bytecode Semantics, 2007

Foundational certification of data-flow analyses.

[BibT_eX]

[DOI]

Maria João Frade

Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering, 2007

Categorical Views on Computations on Trees (Extended Abstract).

[BibT_eX]

[DOI]

Ichiro Hasuo

Bart Jacobs

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Type systems equivalent to data-flow analyses for imperative languages.

[BibT_eX]

[DOI]

Peeter Laud

Theor. Comput. Sci., 2006

Explicit substitutions and higher-order syntax.

[BibT_eX]

[DOI]

Makoto Hamana

High. Order Symb. Comput., 2006

Compositional Type Systems for Stack-Based Low-Level Languages.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2006, 2006

2005

Iteration and coiteration schemes for higher-order and nested datatypes.

[BibT_eX]

[DOI]

Andreas Abel

Theor. Comput. Sci., 2005

Signals and Comonads.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2005

A Compositional Natural Semantics and Hoare Logic for Low-Level Languages.

[BibT_eX]

[DOI]

Proceedings of the Second Workshop on Structural Operational Semantics, 2005

Comonadic functional attribute evaluation.

[BibT_eX]

Proceedings of the Revised Selected Papers from the Sixth Symposium on Trends in Functional Programming, 2005

Monadic augment and generalised short cut fusion.

[BibT_eX]

[DOI]

Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, 2005

The Essence of Dataflow Programming.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, Third Asian Symposium, 2005

2004

Type-based termination of recursive definitions.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2004

Coproducts of Ideal Monads.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2004

Recursive Coalgebras from Comonads.

[BibT_eX]

[DOI]

Venanzio Capretta

Proceedings of the Workshop on Coalgebraic Methods in Computer Science, 2004

Generalizing the AUGMENT combinator.

[BibT_eX]

Proceedings of the Revised Selected Papers from the Fifth Symposium on Trends in Functional Programming, 2004

Normalization by Evaluation for lambda<sup>-2</sup>.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming, 7th International Symposium, 2004

Build, Augment and Destroy, Universally.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems: Second Asian Symposium, 2004

2003

Generalizing Substitution.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2003

Substitution in Non-wellfounded Syntax with Variable Binding.

[BibT_eX]

[DOI]

Proceedings of the 6th International Workshop on Coalgebraic Methods in Computer Science, 2003

Explicit substitutions and higher-order syntax.

[BibT_eX]

[DOI]

Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003

Generalized Iteration and Coiteration for Higher-Order Nested Datatypes.

[BibT_eX]

[DOI]

Andreas Abel

Proceedings of the Foundations of Software Science and Computational Structures, 2003

An Alternative Characterization of Complete Iterativeness (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the FICS '03, 2003

Coproducts of Ideal Monads (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the FICS '03, 2003

2002

Least and greatest fixed points in intuitionistic natural deduction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Monad Translating Inductive and Coinductive Types.

[BibT_eX]

[DOI]

Proceedings of the Types for Proofs and Programs, Second International Workshop, 2002

CPS translating inductive and coinductive types.

[BibT_eX]

[DOI]

Gilles Barthe

Proceedings of the 2002 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '02), 2002

2001

Recursion Schemes from Comonads.

[BibT_eX]

[DOI]

Alberto Pardo

Nord. J. Comput., 2001

The Dual of Substitution is Redecoration.

[BibT_eX]

Proceedings of the Selected papers from the 3rd Scottish Functional Programming Workshop (SFP01), 2001

(Co)monads from inductive and coinductive types (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the APPIA-GULP-PRODE 2001: Joint Conference on Declarative Programming, 2001

1999

Mendler-Style Inductive Types, Categorically.

[BibT_eX]

Nord. J. Comput., 1999

Primitive (Co)Recursion and Course-of-Value (Co)Iteration, Categorically.

[BibT_eX]

[DOI]

Informatica, 1999

1993

Higher-Order Functional Constraint Networks.

[BibT_eX]

[DOI]

Enn Tyugu

Proceedings of the Constraint Programming, 1993

Constraint Satisfaction and Constraint Programming: A Brief Lead-In.

[BibT_eX]

[DOI]

Brian H. Mayoh

Enn Tyugu

Proceedings of the Constraint Programming, 1993

1992

Combining Object-Oriented and Logic Paradigms: A Modal Logic Programming Approach.

[BibT_eX]

[DOI]