Communications of the ACM
Revised report on the algorithm language ALGOL 60
Communications of the ACM
Data types as values: polymorphism, type-checking, encapsulation
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
The complexity of parameter passing in polymorphic procedures
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Some connections between mathematical logic and complexity theory
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A programming language theorem which is independent of Peano Arithmetic
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The consistency of "P = NP" and related problems with fragments of number theory
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Independence results in Computer Science? (Preliminary Version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Abstract data types in the Model programming language
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
On the Semantics of "Data Type"
On the Semantics of "Data Type"
Topics in computational complexity
Topics in computational complexity
An investigation of a programming language with a polymorphic type structure.
An investigation of a programming language with a polymorphic type structure.
Independence results in computer science
ACM SIGACT News
Formal languages and their relation to automata
Formal languages and their relation to automata
Journal of Symbolic Computation
Computable values can be classical
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Empty types in polymorphic lambda calculus
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract types have existential type
ACM Transactions on Programming Languages and Systems (TOPLAS)
Meager and replete failures of relative completeness
Journal of the ACM (JACM)
Conception, evolution, and application of functional programming languages
ACM Computing Surveys (CSUR)
Type reconstruction with first-class polymorphic values
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Completeness of rewrite rules and rewrite strategies for FP
Journal of the ACM (JACM)
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Journal of the ACM (JACM)
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Algebraic reconstruction of types and effects
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functional database query languages as typed lambda calculi of fixed order (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Let-floating: moving bindings to give faster programs
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Embedding type structure in semantics
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract types have existential types
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Denotational semantics and rewrite rules for FP
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Logical and mathematical reasoning about imperative programs: preliminary report
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Code generation techniques for functional languages
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
A type-inference approach to reduction properties and semantics of polymorphic expressions (summary)
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
An algebraic model of sybtypes in object-oriented languages (draft)
OOPWORK '86 Proceedings of the 1986 SIGPLAN workshop on Object-oriented programming
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Structural semantics for polymorphic data types (preliminary report)
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Implicit Computational Complexity for Higher Type Functionals
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Intersection types and λ-definability
Mathematical Structures in Computer Science
Realizability semantics for error-tolerant logics: preliminary version
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
On light logics, uniform encodings and polynomial time
Mathematical Structures in Computer Science
Investigations on the Dual Calculus
Theoretical Computer Science
Third-order Idealized Algol with iteration is decidable
Theoretical Computer Science
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Theoretical Computer Science
A proof assistant for alloy specifications
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.01 |