Type fixpoints: iteration vs. recursion
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Least and greatest fixed points in intuitionistic natural deduction
Theoretical Computer Science - Special issue on theories of types and proofs
Least and greatest fixed points in intuitionistic natural deduction
Theoretical Computer Science - Special issue on theories of types and proofs
On Automating Inductive and Non-inductive Termination Methods
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Extracting General Recursive Program Schemes in Nuprl's Type Theory
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Actual Arithmetic and Feasibility
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
THEORETICAL PEARL Church numerals, twice!
Journal of Functional Programming
Journal of Functional Programming
Realizability of the Axiom of Choice in HOL. (An Analysis of Krivine's Work)
Fundamenta Informaticae - Logic for Pragmatics
The visitor pattern as a reusable, generic, type-safe component
Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Genoa Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming
Realizability for Monotone and Clausular (Co)inductive Definitions
Electronic Notes in Theoretical Computer Science (ENTCS)
Strong normalization and equi-(co)inductive types
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Mixed inductive/coinductive types and strong normalization
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Modular domain-specific language components in scala
GPCE '10 Proceedings of the ninth international conference on Generative programming and component engineering
The Recursion Scheme from the Cofree Recursive Comonad
Electronic Notes in Theoretical Computer Science (ENTCS)
Realizability of the Axiom of Choice in HOL. (An Analysis of Krivine's Work)
Fundamenta Informaticae - Logic for Pragmatics
Hi-index | 0.00 |