Pierce, Benjamin C. - Department of Computer and Information Science, University of Pennsylvania

• Adventures in Bidirectional Programming
• A Bisimulation for Type Abstraction and Recursion EIJIRO SUMII
• Paths Into Patterns Vladimir Gapeyev Benjamin C. Pierce
• What is a File Synchronizer? S. Balasubramaniam
• How Good is Local Type Inference? Haruo Hosoya
• JFP 13 (2): 295316, March 2003. c 2003 Cambridge University Press DOI: 10.1017/S0956796802004550 Printed in the United Kingdom
• Union Types for Semistructured Data Peter Buneman Benjamin Pierce
• A Decision Procedure for the Subtype Relation on Intersection Types
• Foundations for Virtual Types Atsushi Igarashi Benjamin C. Pierce
• Relating Cryptography and Polymorphism Benjamin Pierce Eijiro Sumii y
• HigherOrder Subtyping Martin Steffen \Lambda Benjamin Pierce y
• Concurrent Objects in a Process Calculus
• Behavioral Equivalence in the Polymorphic PiCalculus \Lambda Benjamin C. Pierce
• Book Review Mart' in Abadi and Luca Cardelli
• Logical Relations for Encryption 3 Eijiro Sumii y
• On Binary Methods Kim Bruce \Lambda
• Math. Struct. in Comp. Science (1996), vol. 11, pp. 1--000 Copyright c fl Cambridge University Press
• The Art of Reconciliation Benjamin C. Pierce
• CM026A-03 ACM-TRANSACTION January 23, 2002 17:39 Featherweight Java: A Minimal Core
• On Decidability of Nominal Subtyping with Variance Andrew J. Kennedy
• Woggles from Oz: Writing Interactive Fiction
• Pennsylvania ``programming
• Location-Independent Communication for Mobile Agents: a Two-Level Architecture
• Matching Lenses: Alignment and View Update Davi M. J. Barbosa Julien Cretin
• Preliminary Investigation of a Calculus with
• Comparing Object Encodings \Lambda Kim B. Bruce y
• Local Type Argument Synthesis with Bounded Quantification
• Nate Foster, Michael Greenberg, Benjamin C. Pierce
• Regular Expression Types for XML Haruo Hosoya J
• FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES \Lambda
• Quotient Lenses J. Nathan Foster
• A Logic Your Typechecker Can Count On: Unordered Tree Types in Practice
• Relational Lenses: A Language for Updatable Views
• What is a File Synchronizer? S. Balasubramaniam
• Decoding Choice Encodings \Lambda Uwe Nestmann y
• A Record Calculus Based on Symmetric Concatenation
• Recursive Subtyping Revealed Functional Pearl
• Bounded Quantification is Undecidable Benjamin C. Pierce
• XML Goes Native: Run-time Representations for Xtatic
• Woggles from Oz: Writing Interactive Fiction
• Typing and Subtyping for Mobile Processes
• A Bisimulation for Dynamic Sealing Eijiro Sumii
• Differential Privacy for Collaborative Security Jason Reed, Adam J. Aviv, Daniel Wagner,
• Manifest Security for Distributed Information Karl Crary Robert Harper Frank Pfenning
• Statically Typed Friendly Functions via Partially Abstract
• Bounded Quantification with Bottom Benjamin C. Pierce
• Fancy Types for XML: Benjamin C. Pierce
• Decidable Bounded Quantification Giuseppe Castagna \Lambda
• The Polymorphic Picalculus: Theory and Implementation
• Chairs' Reports General Chair's Report
• Combinators for Bi-Directional Tree Transformations App1 This document is the online-only appendix to
• On Inner Classes Atsushi Igarashi Benjamin C. Pierce
• On Inner Classes Atsushi Igarashi Benjamin C. Pierce
• J. Functional Programming 1 (1): 1--000, January 1993 c fl 1993 Cambridge University Press 1
• Bringing Harmony to Optimism An Experiment in Synchronizing Heterogeneous Tree-Structured Data
• XML Goes Native: Run-time Representations for Xtatic
• Boomerang: Resourceful Lenses for String Data Aaron Bohannon
• Type-based Optimization for Regular Patterns Michael Y. Levin Benjamin C. Pierce
• Corrigendum: Decidable Bounded Quantification Giuseppe Castagna \Lambda
• XDuce: A Typed XML Processing Language (Preliminary Report)
• Symmetric Lenses Martin Hofmann
• Statically Typed Document Transformation: An XTATIC Experience
• join Tracks, Albums deleting from Tracks project Tracks on Track, Rating, Album,
• Symmetric Lenses (Full version)
• Foundational Calculi for Programming Languages [To appear in the CRC Handbook of Computer Science and Engineering]
• Bounded Existentials and Minimal Typing
• Programming With Intersection Types, Union Types,
• synchronizer specification
• Combinators for Bi-Directional Tree Transformations A Linguistic Approach to the View Update Problem
• A Bisimulation for Type Abstraction and Recursion Eijiro Sumii
• Engineering Formal Metatheory Brian Aydemir
• ObjectOriented Programming Without Recursive Types
• Programming with Intersection Types and Bounded Polymorphism
• Positive Subtyping Martin Hofmann \Lambda Benjamin Pierce y
• Pennsylvania Applications
• Math. Struct. in Comp. Science (1995), vol. 11, pp. 1--000 Copyright c fl Cambridge University Press
• Under consideration for publication in J. Functional Programming 1 Regular Expression Pattern Matching for XML
• Pict: A Programming Language Based on the PiCalculus
• Local Type Inference BENJAMIN C. PIERCE
• Using a Proof Assistant to Teach Programming Language Foundations
• Type Destructors Martin Hofmann
• A Recipe for Raw Types Atsushi Igarashi
• Dynamic Typing in Polymorphic Languages
• Programming with Intersection Types and Bounded Polymorphism
• A Model of Delegation Based on Existential Types
• Featherweight Java A Minimal Core Calculus for Java and GJ
• What's in Unison? A Formal Specification and Reference Implementation
• Contracts Made Manifest Michael Greenberg
• benjamin c. pierce university of pennsylvania
• Distance Makes the Types Grow Stronger A Calculus for Differential Privacy
• Proof Assistant as Teaching Assistant
• The Spider Calculus Computing in Active Graphs
• The Ultimate TA Benjamin C. Pierce
• A Formal Investigation of Diff3 Sanjeev Khanna1
• Statically Typed Document Transformation: An XTATIC Experience
• Type-based Optimization for Regular Patterns Michael Y. Levin Benjamin C. Pierce
• The Xtatic Experience Vladimir Gapeyev Michael Y. Levin Benjamin C. Pierce Alan Schmitt
• Regular Expression Types for XML HARUO HOSOYA
• Local Type Inference Benjamin C. Pierce
• Benjamin C. Pierce Computer ScienceDepartment
• A Language for Bi-Directional Tree Transformations Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, and Alan Schmitt
• RUN, Xtatic, RUN: EFFICIENT IMPLEMENTATION OF AN OBJECT-ORIENTED LANGUAGE WITH REGULAR PATTERN
• Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data
• Programming with Intersection Types and Bounded Polymorphism