Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesPIERCE, Benjamin C.ACM SIGPLAN notices. 2009, Vol 44, Num 1, issn 1523-2867, 461 p.Conference Proceedings

Flexible Types : Robust type inference for first-class polymorphismLEIJEN, Daan.ACM SIGPLAN notices. 2009, Vol 44, Num 1, pp 66-77, issn 1523-2867, 12 p.Conference Paper

A bisimulation for type abstraction and recursionSUMII, Eijiro; PIERCE, Benjamin C.Journal of the Association for Computing Machinery. 2007, Vol 54, Num 5, issn 0004-5411, 26-26:43Article

Types and Higher-Order Recursion Schemes for Verification of Higher-Order ProgramsKOBAYASHI, Naoki.ACM SIGPLAN notices. 2009, Vol 44, Num 1, pp 416-428, issn 1523-2867, 13 p.Conference Paper

Expanded versions of selected papers from the 3rd symposium on Theoretical Aspects of Computer Software (TACS '97)ITO, Takayasu; PIERCE, Benjamin C.Information and computation (Print). 1999, Vol 155, Num 1-2, issn 0890-5401, 202 p.Serial Issue

Bidirectionalization for Free! (Pearl)VOIGTLÄNDER, Janis.ACM SIGPLAN notices. 2009, Vol 44, Num 1, pp 165-176, issn 1523-2867, 12 p.Conference Paper

TACS 2001 : theoretical aspects of computer software (Sendai, 29-31 October 2001)Kobayashi, Naoki; Pierce, Benjamin C.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42736-8, XV, 559 p, isbn 3-540-42736-8Conference Proceedings

Modeling Abstract Types in Modules with Open Existential TypesMONTAGU, Benoit; REMY, Didier.ACM SIGPLAN notices. 2009, Vol 44, Num 1, pp 354-365, issn 1523-2867, 12 p.Conference Paper

The Semantics of Progress in Lock-Based Transactional MemoryGUERRAOUI, Rachid; KAPALKA, Michal.ACM SIGPLAN notices. 2009, Vol 44, Num 1, pp 404-415, issn 1523-2867, 12 p.Conference Paper

A Model of Cooperative ThreadsABADI, Martin; PLOTKIN, Gordon.ACM SIGPLAN notices. 2009, Vol 44, Num 1, pp 29-40, issn 1523-2867, 12 p.Conference Paper

Classical BI : (A Logic for Reasoning about Dualising Resources)BROTHERSTON, James; CALCAGNO, Cristiano.ACM SIGPLAN notices. 2009, Vol 44, Num 1, pp 328-339, issn 1523-2867, 12 p.Conference Paper

Lambda, the Ultimate TA: Using a Proof Assistant to Teach Programming Language FoundationsPIERCE, Benjamin C.ACM SIGPLAN notices. 2009, Vol 44, Num 9, issn 1523-2867, p. 121Conference Paper

Masked Types for Sound Object InitializationXIN QI; MYERS, Andrew C.ACM SIGPLAN notices. 2009, Vol 44, Num 1, pp 53-65, issn 1523-2867, 13 p.Conference Paper

Type-based optimization for regular patternsLEVIN, Michael Y; PIERCE, Benjamin C.Lecture notes in computer science. 2005, pp 184-198, issn 0302-9743, isbn 3-540-30951-9, 1Vol, 15 p.Conference Paper

The Girard-Reynolds isomorphismWADLER, Philip.Information and computation (Print). 2003, Vol 186, Num 2, pp 260-284, issn 0890-5401, 25 p.Conference Paper

Foundations for virtual typesIGARASHI, Atsushi; PIERCE, Benjamin C.Information and computation (Print). 2002, Vol 175, Num 1, pp 34-49, issn 0890-5401Conference Paper

Regular expression types for XMLHOSOYA, Haruo; VOUILLON, Jérome; PIERCE, Benjamin C et al.ACM transactions on programming languages and systems. 2005, Vol 27, Num 1, pp 46-90, issn 0164-0925, 45 p.Article

Positive Supercompilation for a Higher Order Call-By-Value LanguageJONSSON, Peter A; NORDLANDER, Johan.ACM SIGPLAN notices. 2009, Vol 44, Num 1, pp 277-288, issn 1523-2867, 12 p.Conference Paper

Relaxed Memory Models : an Operational ApproachBOUDOL, Gérard; PETRI, Gustavo.ACM SIGPLAN notices. 2009, Vol 44, Num 1, pp 392-403, issn 1523-2867, 12 p.Conference Paper

A linear time algorithm for monadic querying of indefinite data over linearly ordered domainsOGAWA, Mizuhito.Information and computation (Print). 2003, Vol 186, Num 2, pp 236-259, issn 0890-5401, 24 p.Conference Paper

Generation of a linear time query processing algorithm based on well-quasi-ordersOGAWA, Mizuhito.Lecture notes in computer science. 2001, pp 283-297, issn 0302-9743, isbn 3-540-42736-8Conference Paper

Termination proofs and complexity certificationLEIVANT, Daniel.Lecture notes in computer science. 2001, pp 183-200, issn 0302-9743, isbn 3-540-42736-8Conference Paper

Nominal logic : A first order theory of names and bindingPITTS, Andrew M.Lecture notes in computer science. 2001, pp 219-242, issn 0302-9743, isbn 3-540-42736-8Conference Paper

A logic programming language based on binding algebrasHAMANA, Makoto.Lecture notes in computer science. 2001, pp 243-262, issn 0302-9743, isbn 3-540-42736-8Conference Paper

Fixed-point logic with the approximation modality and its kripke completenessNAKANO, Hiroshi.Lecture notes in computer science. 2001, pp 165-182, issn 0302-9743, isbn 3-540-42736-8Conference Paper