Search results for "Lambda-calculus"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
12	Pierre-Louis Curien	Abstract Machines, Control, and Sequents.	APPSEM	2000	DBLP DOI BibTeX RDF
12	Peter Dybjer, Andrzej Filinski	Normalization and Partial Evaluation.	APPSEM	2000	DBLP DOI BibTeX RDF
12	Gordon D. Plotkin, John Power, Donald Sannella, Robert D. Tennent	Lax Logical Relations.	ICALP	2000	DBLP DOI BibTeX RDF
12	Manuel M. T. Chakravarty, Gabriele Keller	More types for nested data parallel programming.	ICFP	2000	DBLP DOI BibTeX RDF
12	Yoshihito Toyama	New Challenges for Compuational Models.	IFIP TCS	2000	DBLP DOI BibTeX RDF
12	Healfdene Goguen	Soundness of the Logical Framework for Its Typed Operational Semantics.	TLCA	1999	DBLP DOI BibTeX RDF
12	Marcelo P. Fiore, Alex K. Simpson	Lambda Definability with Sums via Grothendieck Logical Relations.	TLCA	1999	DBLP DOI BibTeX RDF
12	Paul Blain Levy	Call-by-Push-Value: A Subsuming Paradigm.	TLCA	1999	DBLP DOI BibTeX RDF
12	Richard Statman	Consequences of Jacopini's Theorem: Consistent Equalities and Equations.	TLCA	1999	DBLP DOI BibTeX RDF
12	Erik Poll, Jan Zwanenburg	A Logic for Abstract Data Types as Existential Types.	TLCA	1999	DBLP DOI BibTeX RDF
12	Jean-Pierre Jouannaud, Albert Rubio	The Higher-Order Recursive Path Ordering.	LICS	1999	DBLP DOI BibTeX RDF
12	Michael Marz, Alexander Rohr, Thomas Streicher	Full Abstraction and Universality via Realisability.	LICS	1999	DBLP DOI BibTeX RDF	realisability models, full abstraction, domain theory, categorical models
12	Dario Colazzo, Giorgio Ghelli	Subtyping Recursive Types in Kernel Fun.	LICS	1999	DBLP DOI BibTeX RDF	type theory and type systems, kernel Fun, subtyping, recursive types
12	Andreas Abel 0001	Specification and Verification of a Formal System for Structurally Recursive Functions.	TYPES	1999	DBLP DOI BibTeX RDF
12	Christopher League, Zhong Shao, Valery Trifonov	Representing Java Classes in a Typed Intermediate Language.	ICFP	1999	DBLP DOI BibTeX RDF
12	Matthew Bishop	A Breadth-First Strategy for Mating Search.	CADE	1999	DBLP DOI BibTeX RDF
12	Femke van Raamsdonk	Higher-Order Rewriting.	RTA	1999	DBLP DOI BibTeX RDF
12	Vincent Balat, Roberto Di Cosmo	A Linear Logical View of Linear Type Isomorphisms.	CSL	1999	DBLP DOI BibTeX RDF
12	Daniel Leivant	Applicative Control and Computational Complexity.	CSL	1999	DBLP DOI BibTeX RDF
12	Adriana B. Compagnoni, Healfdene Goguen	Anti-Symmetry of Higher-Order Subtyping.	CSL	1999	DBLP DOI BibTeX RDF
12	Michael W. Hicks, Pankaj Kakkar, Jonathan T. Moore, Carl A. Gunter, Scott Nettles	PLAN: A Packet Language for Active Networks.	ICFP	1998	DBLP DOI BibTeX RDF
12	Zhong Shao	Typed Cross-Module Compilation.	ICFP	1998	DBLP DOI BibTeX RDF
12	Ulrich Berger 0001, Matthias Eberl, Helmut Schwichtenberg	Normalisation by Evaluation.	Prospects for Hardware Foundations	1998	DBLP DOI BibTeX RDF
12	Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering	Toward a Complete Transformational Toolkit for Compilers.	ACM Trans. Program. Lang. Syst.	1997	DBLP DOI BibTeX RDF	compiler intermediate representation, program transformation, completion, partial evaluation, term-rewriting, imperative language
12	Johan Agat	Types for Register Allocation.	Implementation of Functional Languages	1997	DBLP DOI BibTeX RDF
12	Wing Lok Yeung	Denotational Semantics for JSD.	APSEC	1997	DBLP DOI BibTeX RDF
12	Sergei G. Vorobyov	The "Hardest" Natural Decidable Theory.	LICS	1997	DBLP DOI BibTeX RDF
12	J. B. Wells, Allyn Dimock, Robert Muller, Franklyn A. Turbak	A Typed Intermediate Language for Flow-Directed Compilation.	TAPSOFT	1997	DBLP DOI BibTeX RDF
12	Viviana Bono, Michele Bugliesi, Mariangiola Dezani-Ciancaglini, Luigi Liquori	Subtyping Constraints for Incomplete Objects (Extended Abstract).	TAPSOFT	1997	DBLP DOI BibTeX RDF
12	Matthias Blume, Andrew W. Appel	Lambda-Splitting: A Higher-Order Approach to Cross-Module Optimizations.	ICFP	1997	DBLP DOI BibTeX RDF
12	Vincent van Oostrom	Finite Family Developments.	RTA	1997	DBLP DOI BibTeX RDF
12	Cordelia V. Hall, Kevin Hammond, Simon L. Peyton Jones, Philip Wadler	Type Classes in Haskell.	ACM Trans. Program. Lang. Syst.	1996	DBLP DOI BibTeX RDF	functional programming, Haskell, Haskell, types, type classes
12	Richard Kennaway, Vincent van Oostrom, Fer-Jan de Vries	Meaningless Terms in Rewriting.	ALP	1996	DBLP DOI BibTeX RDF
12	Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering	A Complete Transformational Toolkit for Compilers.	ESOP	1996	DBLP DOI BibTeX RDF
12	Wieslaw Pawlowski, Pawel Paczkowski, Stefan Sokolowski	Specifying and Verifying Parametric Processes.	MFCS	1996	DBLP DOI BibTeX RDF
12	Guy E. Blelloch, John Greiner	A Provable Time and Space Efficient Implementation of NESL.	ICFP	1996	DBLP DOI BibTeX RDF
12	Brian T. Howard	Inductive, Coinductive, and Pointed Types.	ICFP	1996	DBLP DOI BibTeX RDF
12	Kenneth Slonneger	Executing an SECD machine using logic programming.	SIGCSE	1995	DBLP DOI BibTeX RDF
12	N. G. de Bruijn	Highlighting the Lambda-free Fragment of Automath.	TPHOLs	1994	DBLP DOI BibTeX RDF
12	David A. Naumann	On the Essence of Oberon.	Programming Languages and System Architectures	1994	DBLP DOI BibTeX RDF
12	Cordelia V. Hall, Kevin Hammond, Simon L. Peyton Jones, Philip Wadler	Type Classes in Haskell.	ESOP	1994	DBLP DOI BibTeX RDF
12	Corrado Böhm, Adolfo Piperno, Stefano Guerrini	Lambda-Definition of Function(al)s by Normal Forms.	ESOP	1994	DBLP DOI BibTeX RDF
12	Hideki Tsuiki	On Typed Calculi with a Merge Operator.	FSTTCS	1994	DBLP DOI BibTeX RDF
12	Ian Mackie, Leopoldo Román, Samson Abramsky	An internal language for autonomous categories.	Appl. Categorical Struct.	1993	DBLP DOI BibTeX RDF	Symmetric monoidal closed (autonomous) categories, internal languages, natural numbers objects, linear logic, coherence
12	Sergei Soloviev 0001	A Complete Axiom System for Isomorphism of Types in Closed Categories.	LPAR	1993	DBLP DOI BibTeX RDF
12	Mitchell Wand	Specifying the Correctness of Binding-Time Analysis.	POPL	1993	DBLP DOI BibTeX RDF
12	Kim B. Bruce	Safe Type Checking in a Statically-Typed Object-Oriented Programming Language.	POPL	1993	DBLP DOI BibTeX RDF
12	Marcin Benke	Efficient Type Reconstruction in the Presence of Inheritance.	MFCS	1993	DBLP DOI BibTeX RDF
12	Adrian Fiech	Category of Delta-Functors.	MFPS	1993	DBLP DOI BibTeX RDF
12	Allen Stoughton	Mechanizing Logical Relations.	MFPS	1993	DBLP DOI BibTeX RDF
12	Steffen van Bakel	Essential Intersection Type Assignment.	FSTTCS	1993	DBLP DOI BibTeX RDF
12	Robert Cartwright, Matthias Felleisen	Observable Sequentiality and Full Abstraction.	POPL	1992	DBLP DOI BibTeX RDF
12	Paul Hudak, Jonathan Young	Collecting Interpretations of Expressions.	ACM Trans. Program. Lang. Syst.	1991	DBLP DOI BibTeX RDF	theory
12	Gary T. Leavens, Don Pigozzi	Typed Homomorphic Relations Extended with Sybtypes.	MFPS	1991	DBLP DOI BibTeX RDF
12	Neal Nelson	Primitive Recursive Functionals with Dependent Types.	MFPS	1991	DBLP DOI BibTeX RDF
12	Timothy A. Budd, Rajeev K. Pandey	Compiling APL for Parallel and Vector Execution.	APL	1991	DBLP DOI BibTeX RDF	APL
12	Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries	Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract).	RTA	1991	DBLP DOI BibTeX RDF	orthogonal term rewriting systems, infinitary rewriting, strong converging reductions, infinite Church-Rosser Properties, Böhm Trees, head normal forms, non-unifiable term rewriting systems, normal forms
12	Henry G. Baker	Unify and Conquer.	LISP and Functional Programming	1990	DBLP DOI BibTeX RDF
12	Brian T. Howard, John C. Mitchell	Operational and Axiomatic Semantics of PCF.	LISP and Functional Programming	1990	DBLP DOI BibTeX RDF
12	Pierre-Louis Curien, Giorgio Ghelli	Coherence of Subsumption.	CAAP	1990	DBLP DOI BibTeX RDF
12	John D. Ramsdell	The Alonzo functional programming language.	ACM SIGPLAN Notices	1989	DBLP DOI BibTeX RDF
12	Torben Æ. Mogensen	Binding Time Analysis for Polymorphically Typed Higher Order Languages.	TAPSOFT, Vol.2	1989	DBLP DOI BibTeX RDF	semantics, projections, partial evaluation, functional languages, compiler generation, binding time analysis
12	K. Gopinath, John L. Hennessy	Copy Elimination in Functional Languages.	POPL	1989	DBLP DOI BibTeX RDF
12	Richard Kelsey, Paul Hudak	Realistic Compilation by Program Transformation.	POPL	1989	DBLP DOI BibTeX RDF	T
12	Felice Cardone	Relational Semantics for Recursive Types and Bounded Quantification.	ICALP	1989	DBLP DOI BibTeX RDF
12	Luca Cardelli, John C. Mitchell	Operations on Records.	Mathematical Foundations of Programming Semantics	1989	DBLP DOI BibTeX RDF
12	J. M. E. Hyland, Edmund P. Robinson, Giuseppe Rosolini	Algebraic Types in PER Models.	Mathematical Foundations of Programming Semantics	1989	DBLP DOI BibTeX RDF
12	James W. O'Toole Jr., David K. Gifford	Type Reconstruction with First-Class Polymorphic Values.	PLDI	1989	DBLP DOI BibTeX RDF
12	Natarajan Shankar	A mechanical proof of the Church-Rosser theorem.	J. ACM	1988	DBLP DOI BibTeX RDF
12	John C. Mitchell, Gordon D. Plotkin	Abstract Types Have Existential Type.	ACM Trans. Program. Lang. Syst.	1988	DBLP DOI BibTeX RDF
12	Paul Hudak, Jonathan Young	A Collecting Interpretation of Expressions (Without Powerdomains). (long version: TOPLAS 13(2): 269-290 (1991))	POPL	1988	DBLP DOI BibTeX RDF
12	Michel Parigot	Programming with Proofs: A Second Order Type Theory.	ESOP	1988	DBLP DOI BibTeX RDF
12	Daniel Leivant, Tim Fernando	Skinny and Fleshy Failures of Relative Completeness.	POPL	1987	DBLP DOI BibTeX RDF
12	Val Tannen, Albert R. Meyer	Computable Values Can Be Classical.	POPL	1987	DBLP DOI BibTeX RDF
12	Gregory F. Johnson	GL-a denotational testbed with continuations and partial continuations as first-class objects.	PLDI	1987	DBLP DOI BibTeX RDF
12	Hendrik Pieter Barendregt, Marko C. J. D. van Eekelen, John R. W. Glauert, Richard Kennaway, Marinus J. Plasmeijer, M. Ronan Sleep	Term Graph Rewriting.	PARLE (2)	1987	DBLP DOI BibTeX RDF
12	Rolf Bahlke, Gregor Snelting	The PSG System: From Formal Language Definitions to Interactive Programming Environments.	ACM Trans. Program. Lang. Syst.	1986	DBLP DOI BibTeX RDF
12	John C. Mitchell	Representation Independence and Data Abstraction.	POPL	1986	DBLP DOI BibTeX RDF
12	Corrado Böhm	Reducing Recursion to Iteration by Algebraic Extension.	ESOP	1986	DBLP DOI BibTeX RDF	subrecursive function theory, Functional programming, initial algebras, algebraic data types, term algebras
12	John C. Reynolds	Three Approaches to Type Structure.	TAPSOFT, Vol.1	1985	DBLP DOI BibTeX RDF
12	Christine Choppy, G. Guiho, Stéphane Kaplan	A Lisp Compiler for FP Language and Its Proof via Algebraic Semantics.	TAPSOFT, Vol.1	1985	DBLP DOI BibTeX RDF
12	J. W. de Bakker, Joost N. Kok	Towards a Uniform Topological Treatment of Streams and Functions on Streams.	ICALP	1985	DBLP DOI BibTeX RDF
12	Mitchell Wand	A semantic prototyping system.	SIGPLAN Symposium on Compiler Construction	1984	DBLP DOI BibTeX RDF
12	Carl Hewitt, Tom Reinhardt, Gul Agha, Giuseppe Attardi	Linguistic Support of Receptionists for Shared Resources.	Seminar on Concurrency	1984	DBLP DOI BibTeX RDF
12	Daniel Leivant	Structural Semantics for Polymorphic Data Types.	POPL	1983	DBLP DOI BibTeX RDF
12	Neil D. Jones, David A. Schmidt	Compiler generation from denotational semantics.	Semantics-Directed Compiler Generation	1980	DBLP DOI BibTeX RDF