ACM Transactions on Programming Languages and Systems (TOPLAS)
On understanding types, data abstraction, and polymorphism
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Provable isomorphisms and domain equations in models of typed languages
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
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)
Type theories and object-oriented programmimg
ACM Computing Surveys (CSUR)
Partial polymorphic type inference and higher-order unification
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Bounded quantifiers have interval models
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Conception, evolution, and application of functional programming languages
ACM Computing Surveys (CSUR)
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference in the presence of type abstraction
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Interfaces for strongly-typed object-oriented programming
OOPSLA '89 Conference proceedings on Object-oriented programming systems, languages and applications
Relating models of polymorphism
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Type-dependent parameter inference
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Higher-order modules and the phase distinction
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
The complexity of type inference for higher-order lambda calculi
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A record calculus based on symmetric concatenation
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Polymorphic type inference and assignment
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Generic instantiations as closures
ACM SIGAda Ada Letters
Strictness and binding-time analyses: two for the price of one
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
On extending computational adequacy by data abstraction
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
A compilation method for ML-style polymorphic record calculi
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bounded quantification is undecidable
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Elements of interaction: Turing award lecture
Communications of the ACM
An introduction to logical relations and parametric polymorphism (abstract)
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Explicit polymorphism and CPS conversion
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Safe type checking in a statically-typed object-oriented programming language
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference with polymorphic recursion
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the type structure of standard ML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Second-order signature: a tool for specifying data models, query processing, and optimization
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Decidable bounded quantification
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extending PowerEpsilon with algebraic rewriting
ACM SIGPLAN Notices
A direct algorithm for type inference in the rank-2 fragment of the second-order &lgr;-calculus
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Compiling polymorphism using intensional type analysis
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parametricity and local variables
Journal of the ACM (JACM)
A polymorphic record calculus and its compilation
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
On genericity and parametricity (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Putting type annotations to work
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantics: the description of computational structures
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Flexible representation analysis
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Behavioral equivalence in the polymorphic pi-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
First-class polymorphism with type inference
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From system F to typed assembly language
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typed cross-module compilation
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Encoding types in ML-like languages
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Implementing typed intermediate languages
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Type inference with rank 1 polymorphism for type-directed compilation of ML
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Representing Java classes in a typed intermediate language
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Principals in programming languages: a syntactic proof technique
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Transparent modules with fully syntatic signatures
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
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
Logical and mathematical reasoning about imperative programs: preliminary report
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
From system F to typed assembly language
ACM Transactions on Programming Languages and Systems (TOPLAS)
Integrating functional and imperative programming
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
The Expressiveness of Simple and Second-Order Type Structures
Journal of the ACM (JACM)
An algebraic model of sybtypes in object-oriented languages (draft)
OOPWORK '86 Proceedings of the 1986 SIGPLAN workshop on Object-oriented programming
A semantic model of types and machine instructions for proof-carrying code
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Type-safe cast: (functional pearl)
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Fully reflexive intensional type analysis
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Oracle-based checking of untrusted software
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The denotational semantics of programming languages
Communications of the ACM
ACM Transactions on Programming Languages and Systems (TOPLAS)
Representation independence, confinement and access control [extended abstract]
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An induction principle for pure type systems
Theoretical Computer Science
Representation independence and data abstraction
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Using dependent types to express modular structure
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Type-preserving compilation of Featherweight Java
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Data types, parameters and type checking
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Retraction Approach to CPS Transform
Higher-Order and Symbolic Computation
A Generalization of Short-Cut Fusion and its Correctness Proof
Higher-Order and Symbolic Computation
Intensional analysis of quantified types
ACM Transactions on Programming Languages and Systems (TOPLAS)
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Refining the Barendregt Cube Using Parameters
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
The Essence of Principal Typings
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Girard-Reynolds Isomorphism
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
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
A domain-theoretic semantics of lax generic functions
Theoretical Computer Science - Category theory and computer science
Programming methodology
A relational account of call-by-value sequentiality
Information and Computation - Special issue: LICS'97
Rank 2 intersection types for local definitions and conditional expressions
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
The Curry-Howard Correspondence in Set Theory
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A types-as-sets semantics for milner-style polymorphism
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An ideal model for recursive polymorphic types
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A semantic model of types for applicative languages
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
A programming language theorem which is independent of Peano Arithmetic
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Simplifying ADA by removing limitations
ACM SIGPLAN Notices
The Girard--Reynolds isomorphism
Information and Computation - TACS 2001
Free theorems in the presence of seq
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intersection types and λ-definability
Mathematical Structures in Computer Science
βη-complete models for System F
Mathematical Structures in Computer Science
Perpetuality in a named lambda calculus with explicit substitutions
Mathematical Structures in Computer Science
Parametric polymorphism and operational equivalence
Mathematical Structures in Computer Science
Conditions for the completeness of functional and algebraic equational reasoning
Mathematical Structures in Computer Science
Stratified polymorphism and primitive recursion
Mathematical Structures in Computer Science
Intersection types and bounded polymorphism
Mathematical Structures in Computer Science
Journal of Functional Programming
Inlining as staged computation
Journal of Functional Programming
A calculus with polymorphic and polyvariant flow types
Journal of Functional Programming
A static semantics for Haskell
Journal of Functional Programming
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Correctness of data representations involving heap data structures
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
MetaKlaim: a type safe multi-stage language for global computing
Mathematical Structures in Computer Science
ACM SIGPLAN Notices
Building continuous webbed models for system F
Theoretical Computer Science - Mathematical foundations of programming semantics
Encoding types in ML-like languages
Theoretical Computer Science - Mathematical foundations of programming semantics
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Translating dependency into parametricity
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
THEORETICAL PEARL Church numerals, twice!
Journal of Functional Programming
Mathematical Structures in Computer Science
An elementary fragment of second-order lambda calculus
ACM Transactions on Computational Logic (TOCL)
Essential language support for generic programming
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Typed $\lambda$-calculi with one binder
Journal of Functional Programming
THEORETICAL PEARLS: A bargain for intersection types: a simple strong normalization proof
Journal of Functional Programming
The future of symbolic computation: mathematics versus languages
ACM SIGSAM Bulletin
The logic of demand in Haskell
Journal of Functional Programming
Parametric polymorphism for software component architectures
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Ownership confinement ensures representation independence for object-oriented programs
Journal of the ACM (JACM)
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Quantified types in an imperative language
ACM Transactions on Programming Languages and Systems (TOPLAS)
Ensuring termination by typability
Information and Computation
Journal of Functional Programming
The Impact of seq on Free Theorems-Based Program Transformations
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
Syntactic Logical Relations for Polymorphic and Recursive Types
Electronic Notes in Theoretical Computer Science (ENTCS)
The Girard—Reynolds isomorphism (second edition)
Theoretical Computer Science
Typed common intermediate format
DSL'97 Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997
An abstraction-based genetic programming system
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
ACM Turing award lectures
Tangible functional programming
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
A generic usage analysis with subeffect qualifiers
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Domain-theoretical models of parametric polymorphism
Theoretical Computer Science
Selective strictness and parametricity in structural operational semantics, inequationally
Theoretical Computer Science
The Completeness of Typing for Context-Semantics
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Genetic programming with polymorphic types and higher-order functions
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Curry-style type isomorphisms and game semantics
Mathematical Structures in Computer Science
Haskell session types with (almost) no class
Proceedings of the first ACM SIGPLAN symposium on Haskell
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Extensional Universal Types for Call-by-Value
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
A family of syntactic logical relations for the semantics of Haskell-like languages
Information and Computation
Mathematical Structures in Computer Science
Information and Computation
Semantic predicate types and approximation for class-based object oriented programming
Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs
Parametric datatype-genericity
Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming
Unembedding domain-specific languages
Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
Electronic Notes in Theoretical Computer Science (ENTCS)
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Singleton types here, singleton types there, singleton types everywhere
Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification
Lightweight linear types in system f°
Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementation
A game semantics for generic polymorphism
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
A new model construction for the polymorphic lambda calculus
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Correctness of data representations involving heap data structures
ESOP'03 Proceedings of the 12th European conference on Programming
Proving noninterference by a fully complete translation to the simply typed λ-calculus
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
SSDGP'06 Proceedings of the 2006 international conference on Datatype-generic programming
Intersection, universally quantified, and reference types
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Type checking and inference for polymorphic and existential types
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Game semantics for call-by-value polymorphism
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
A language for generic programming in the large
Science of Computer Programming
Theoretical Computer Science
JavaGI: The Interaction of Type Classes with Interfaces and Inheritance
ACM Transactions on Programming Languages and Systems (TOPLAS)
Generic constructions for behavioral specifications
Theoretical Computer Science
A simple semantics for polymorphic recursion
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Rank-2 intersection and polymorphic recursion
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Language requirements for large-scale generic libraries
GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
Automatically generating counterexamples to naive free theorems
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Stateful contracts for affine types
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Approaches to polymorphism in classical sequent calculus
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Generic procedures: An implementation and an undecidability result
Computer Languages
Expansion for universal quantifiers
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Pure type systems with corecursion on streams: from finite to infinitary normalisation
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
The Completeness of Typing for Context-Semantics
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Extensibility for the masses: practical extensibility with object algebras
ECOOP'12 Proceedings of the 26th European conference on Object-Oriented Programming
The Impact of seq on Free Theorems-Based Program Transformations
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
SSGIP'10 Proceedings of the 2010 international spring school conference on Generic and Indexed Programming
Parametric And Type-Dependent Polymorphism
Fundamenta Informaticae
A polymorphic type system with progress for binary sessions
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
Behavioral polymorphism and parametricity in session-based communication
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Game semantics for a polymorphic programming language
Journal of the ACM (JACM)
Feature-Oriented programming with object algebras
ECOOP'13 Proceedings of the 27th European conference on Object-Oriented Programming
The HERMIT in the stream: fusing stream fusion's concatMap
Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation
Intersection Types from a Proof-theoretic Perspective
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.04 |