A mechanical proof of the Church-Rosser theorem
Journal of the ACM (JACM)
Director strings as combinators
ACM Transactions on Programming Languages and Systems (TOPLAS)
Higher-order unification revisited: Complete sets of transformations
Journal of Symbolic Computation
Dynamic typing in a statically-typed language
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relating models of polymorphism
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On laziness and optimality in lambda interpreters: tools for specification and analysis
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A simple semantics for ML polymorphism
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic typing in a statically typed language
ACM Transactions on Programming Languages and Systems (TOPLAS)
Detecting static algorithms by partial evaluation
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
O.LISP theoretical basis and description
ACM SIGPLAN Notices
A denotational semantics for the Starburst production rule language
ACM SIGMOD Record
A confluent calculus of Macro expansion and evaluation
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Type isomorphisms in a type-assignment framework
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference with polymorphic recursion
ACM Transactions on Programming Languages and Systems (TOPLAS)
Combinatory representation of mobile processes
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Confluence properties of weak and strong calculi of explicit substitutions
Journal of the ACM (JACM)
A practical soft type system for scheme
ACM Transactions on Programming Languages and Systems (TOPLAS)
A framework for implementing hypothetical queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Multi-stage programming with explicit annotations
PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Parallel beta reduction is not elementary recursive
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Combinatory formulations of concurrent languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Functional and constraint logic programming
Constraints in computational logics
Primitive string transformations as reductions to normal form
ACM SIGPLAN Notices
Completeness of intersection and union type assignment systems for call-by-value λ-models
Theoretical Computer Science - Special issue on theories of types and proofs
Completeness of type assignment systems with intersection, union, and type quantifiers
Theoretical Computer Science - Special issue on theories of types and proofs
Down with Emacs Lisp: dynamic scope analysis
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
MBase: representing knowledge and context for the intergration of mathematical software systems
Journal of Symbolic Computation - Calculemus-99: integrating computation and deduction
The derivation of functional equivalents of imperative programs
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Parallel beta reduction is not elementary recursive
Information and Computation
Managing Structural Information by Higher-Order Colored Unification
Journal of Automated Reasoning
Basic Simple Type Theory, J. Roger Hindley
Journal of Logic, Language and Information
Uniqueness of Normal Proofs in Implicational Intuitionistic Logic
Journal of Logic, Language and Information
A complete characterization of complete intersection-type preorders
ACM Transactions on Computational Logic (TOCL)
CPS Translations and Applications: The Cube and Beyond
Higher-Order and Symbolic Computation
Some analytic features of algebraic data
Discrete Applied Mathematics
Efficient multi-variate abstraction using an array representation for combinators
Information Processing Letters
On introducing higher order functions in ABEL
Nordic Journal of Computing
Stability of Metabolic and Balanced Organisations
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
A Domain-theoretic Approach to Integrating Functional and Logic Database Languages
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Investigation of Algebraic Query Optimisation Techniques for Database Programming Languages
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Refining the Barendregt Cube Using Parameters
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
On Functions and Types: A Tutorial
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Combining Pattern E-Unification Algorithms
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Confluence and Termination of Simply Typed Term Rewriting Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Using, Understanding, and Unraveling the OCaml Language. From Practice to Theory and Vice Versa
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Decidability of Bounded Higher-Order Unification
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Algebraic query optimisation for database programming languages
The VLDB Journal — The International Journal on Very Large Data Bases
Higher-order unification and matching
Handbook of automated reasoning
Theories with self-application and computational complexity
Information and Computation
Proof theory of higher-order equations: conservativity, normal forms and term rewriting
Journal of Computer and System Sciences
A simple proof of the undecidability of strong normalisation
Mathematical Structures in Computer Science
A proof-irrelevant model of Martin-Löf's logical framework
Mathematical Structures in Computer Science
Decidability of fourth-order matching
Mathematical Structures in Computer Science
Some logical and syntactical observations concerning the first-order dependent type system λP
Mathematical Structures in Computer Science
From λ to π; or, Rediscovering continuations
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
A uniform approach to domain theory in realizability models
Mathematical Structures in Computer Science
Intuitionistic model constructions and normalization proofs
Mathematical Structures in Computer Science
Single Assignment C: efficient support for high-level array operations in a functional setting
Journal of Functional Programming
Higher-order narrowing with definitional trees
Journal of Functional Programming
Modularity of strong normalization in the algebraic-λ-cube
Journal of Functional Programming
An approach to multilevel semantics for applied systems
ANLC '92 Proceedings of the third conference on Applied natural language processing
Parsing and derivational equivalence
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Proof figures and structural operators for categorial grammar
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Parametric parameter passing λ-calculus
Information and Computation
Journal of Logic, Language and Information
Long-distance dependencies and Applicative Universal Grammar
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Free-ordered CUG on Chemical Abstract Machine
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
A formal representation of the thematic-rhematic structure of sentences based on a typed Λ-calculus
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Linear lambda calculus and PTIME-completeness
Journal of Functional Programming
Managing inconsistent repositories via prioritized repairs
Proceedings of the 2004 ACM symposium on Document engineering
ACM Transactions on Programming Languages and Systems (TOPLAS)
A proof-theoretic characterization of the basic feasible functionals
Theoretical Computer Science
A computational treatment of Korean temporal markers, OE and DONGAN
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
A structural approach to reversible computation
Theoretical Computer Science
Mathematical Structures in Computer Science
A calculus for reasoning about software composition
Theoretical Computer Science - Formal methods for components and objects
Understanding Programming Languages
Minds and Machines
An Introduction to the Lambda Calculus
Central European Functional Programming School
Central European Functional Programming School
Formal Structure of Sanskrit Text: Requirements Analysis for a Mechanical Sanskrit Processor
Sanskrit Computational Linguistics
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
A direct proof of the confluence of combinatory strong reduction
Theoretical Computer Science
A formal framework for database sampling
Information and Software Technology
Decidability of bounded higher-order unification
Journal of Symbolic Computation
Well-going programs can be typed
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
A higher-order demand-driven narrowing calculus with definitional trees
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Types for hereditary head normalizing terms
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
RPO, second-order contexts, and λ-calculus
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Extending EBG to term-rewriting systems
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Cooperation of algebraic constraint domains in higher-order functional and logic programming
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
A modular semantics for higher-order declarative programming with constraints
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Typed self-interpretation by pattern matching
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Toward general analysis of recursive probability models
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Proof pearl: using combinators to manipulate let-expressions in proof
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
A functional shell that dynamically combines compiled code
IFL'03 Proceedings of the 15th international conference on Implementation of Functional Languages
A functional shell that operates on typed and compiled applications
AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
Reduction strategies for left-linear term rewriting systems
Processes, Terms and Cycles
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
The small grzegorczyk classes and the typed λ-calculus
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
A functional logic language based on higher order narrowing
FP'95 Proceedings of the 1995 international conference on Functional Programming
Parametric And Type-Dependent Polymorphism
Fundamenta Informaticae
Remarks on semantic completeness for proof-terms with Laird's dual affine/intuitionistic λ-Calculus
Rewriting Computation and Proof
Theory and Practice of Logic Programming
A Process Calculus with Finitary Comprehended Terms
Theory of Computing Systems
Nominal Lambda Calculus: An Internal Language for FM-Cartesian Closed Categories
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |