|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 658 occurrences of 307 keywords
|
|
|
Results
Found 1386 publication records. Showing 1386 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
52 | Ugo Dal Lago, Simone Martini 0001 |
An Invariant Cost Model for the Lambda Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pp. 105-114, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Paolo Coppola 0001, Ugo Dal Lago, Simona Ronchi Della Rocca |
Elementary Affine Logic and the Call-by-Value Lambda Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings, pp. 131-145, 2005, Springer, 3-540-25593-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
52 | Antonio Bucciarelli, Antonino Salibra |
The Minimal Graph Model of Lambda Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings, pp. 300-307, 2003, Springer, 3-540-40671-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
52 | Andrew K. Wright, Suresh Jagannathan, Cristian Ungureanu, Aaron Hertzmann |
Compiling Java to a Typed Lambda-Calculus: A Preliminary Report. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Types in Compilation ![In: Types in Compilation, Second International Workshop, TIC '98, Kyoto, Japan, March 25-27, 1998, Proceedings, pp. 9-27, 1998, Springer, 3-540-64925-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
52 | Slawomir Lasota 0001, David Nowak, Yu Zhang |
On Completeness of Logical Relations for Monadic Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIAN ![In: Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues, 11th Asian Computing Science Conference, Tokyo, Japan, December 6-8, 2006, Revised Selected Papers, pp. 223-230, 2006, Springer, 978-3-540-77504-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Thomas Ehrhard, Laurent Regnier |
Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pp. 186-197, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
50 | Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor |
Psi-calculi: Mobile Processes, Nominal Data, and Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA, pp. 39-48, 2009, IEEE Computer Society, 978-0-7695-3746-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
49 | Jerome Vouillon |
Subtyping Union Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings, pp. 415-429, 2004, Springer, 3-540-23024-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
semantics, lambda-calculus, subtyping, union types |
49 | Zoltán Csörnyei, Gergely Dévai |
An Introduction to the Lambda Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEFP ![In: Central European Functional Programming School, Second Summer School, CEFP 2007, Cluj-Napoca, Romania, June 23-30, 2007, Revised Selected Lectures, pp. 87-111, 2007, Springer, 978-3-540-88058-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
48 | Silvio Valentini |
An elementary proof of strong normalization for intersection types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 40(7), pp. 475-488, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Normalization, Lambda calculus, Intersection types |
48 | Georg Struth |
Calculating Church-Rosser Proofs in Kleene Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RelMiCS ![In: Relational Methods in Computer Science, 6th International Conference, RelMICS 2001, and 1st Workshop of COST Action 274 TARSKI Oisterwijk, The Netherlands, October 16-21, 2001, Revised Papers, pp. 276-290, 2001, Springer, 3-540-00315-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
$lambda$-calculus, Church-Rosser theorem, rewriting, Kleene algebra, formal mathematics |
48 | Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn |
Linear Ramified Higher Type Recursion and Parallel Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Theory in Computer Science ![In: Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings, pp. 1-21, 2001, Springer, 3-540-42752-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
higher types, parallel computation, recursion, linear logic, lambda calculus, implicit computational complexity, NC |
48 | Olivier Danvy, Morten Rhiger |
A Simple Take on Typed Abstract Syntax in Haskell-like Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLOPS ![In: Functional and Logic Programming, 5th International Symposium, FLOPS 2001, Tokyo, Japan, March 7-9, 2001, Proceedings, pp. 343-358, 2001, Springer, 3-540-41739-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Type-directed partial evaluation, normalization functions, simply typed lambda-calculus, Haskell, higher-order abstract syntax |
48 | Roberto M. Amadio |
On the Adequacy of Per Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings, pp. 222-231, 1993, Springer, 3-540-57182-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Second order lambda-calculus, Per models, Denotational vs. Operational Semantics |
48 | Anindya Banerjee 0001, Nevin Heintze, Jon G. Riecke |
Region Analysis and the Polymorphic Lambda Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, pp. 88-97, 1999, IEEE Computer Society, 0-7695-0158-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
semantics, program analysis, garbage collection, memory management, polymorphism |
48 | Carolina Lavatelli |
Algebraic Interpretation of Lambda Calculus with Resources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR '96, Concurrency Theory, 7th International Conference, Pisa, Italy, August 26-29, 1996, Proceedings, pp. 422-437, 1996, Springer, 3-540-61604-7. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
48 | Ian Mackie |
YALE: Yet Another Lambda Evaluator Based on Interaction Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP '98), Baltimore, Maryland, USA, September 27-29, 1998., pp. 117-128, 1998, ACM, 1-58113-024-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
47 | Zdzislaw Splawski, Pawel Urzyczyn |
Type Fixpoints: Iteration vs. Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), Paris, France, September 27-29, 1999., pp. 102-113, 1999, ACM, 1-58113-111-9. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
45 | Amr Sabry, Philip Wadler |
A Reflection on Call-by-Value. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 19(6), pp. 916-941, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
compiling, continuations, category theory, Galois connections |
45 | Ronald Garcia, Andrew Lumsdaine, Amr Sabry |
Lazy evaluation and delimited control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009, pp. 153-164, 2009, ACM, 978-1-60558-379-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
call-by-need, lambda calculus, abstract machines, delimited continuations, reduction semantics |
45 | Gordon D. Plotkin, Matija Pretnar |
A Logic for Algebraic Effects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 118-129, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
call-by-push-value, computational lambda-calculus, program logics, computational effects, algebraic operations |
45 | Philip Wadler |
Call-by-value is dual to call-by-name. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, ICFP 2003, Uppsala, Sweden, August 25-29, 2003, pp. 189-201, 2003, ACM, 1-58113-756-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Curry-Howard correspondence, De Morgan dual, lambda mu calculus, logic, lambda calculus, sequent calculus, natural deduction |
45 | Francisco Gutiérrez, Blas C. Ruiz |
A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPSTR ![In: Logic Based Program Synthesis and Tranformation, 12th International Workshop, LOPSTR 2002, Madrid, Spain, September 17-20,2002, Revised Selected Papers, pp. 17-31, 2002, Springer, 3-540-40438-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
lambda calculus with types, pure type systems, cut elimination, sequent calculi |
45 | György E. Révész |
Rule-Based Semantics for an Extended Lambda-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFPS ![In: Mathematical Foundations of Programming Language Semantics, 3rd Workshop, Tulane University, New Orleans, Louisiana, USA, April 8-10, 1987, Proceedings, pp. 43-56, 1987, Springer, 3-540-19020-1. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
45 | Rose H. Abdul Rauf, Ulrich Berger 0001, Anton Setzer |
A Provably Correct Translation of the lambda -Calculus into a Mathematical Model of C++. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 43(3-4), pp. 298-321, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Simply typed lambda-calculus, Kripke-style logical relation, Object-oriented programming, Functional programming, Inheritance, Denotational semantics, Correctness proof |
45 | Peter M. Kelly, Paul D. Coddington, Andrew L. Wendelborn |
Lambda Calculus as a Workflow Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GPC Workshops ![In: Workshops at the Grid and Pervasive Computing Conference, GPC 2008, Kunming, China, May 25-28, 2008, pp. 15-22, 2008, IEEE Computer Society, 978-0-7695-3177-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
workflow, lambda calculus |
45 | Sol Swords, William R. Cook |
Soundness of the simply typed lambda calculus in ACL2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACL2 ![In: Proceedings of the Sixth International Workshop on the ACL2 Theorem Prover and its Applications, ACL2 2006, Seattle, Washington, USA, August 15-16, 2006, pp. 35-39, 2006, ACM, 0-9788493-0-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
lambda-calculus, soundness, ACL2 |
45 | Marco Pedicini, Francesco Quaglia |
A parallel implementation for optimal lambda-calculus reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 2nd international ACM SIGPLAN conference on on Principles and practice of declarative programming, Montreal, Canada, September 20-23, 2000, pp. 3-14, 2000, ACM, 1-58113-265-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
optimal reduction, virtual reduction, functional programming, linear logic, lambda calculus, parallel implementation, geometry of interaction |
45 | C.-H. Luke Ong |
Fully Abstract Models of the Lazy Lambda Calculus ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 368-376, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
convergence testing, lazy lambda calculus, lazy languages, functional languages, proof theory, model theory, abstract models |
44 | John Power |
A Universal Embedding for the Higher Order Structure of Computational Effects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings., pp. 301-315, 2003, Springer, 3-540-40332-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Paula Severi, Fer-Jan de Vries |
Continuity and Discontinuity in Lambda Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings, pp. 369-385, 2005, Springer, 3-540-25593-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Alex K. Simpson |
Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 219-234, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Sylvain Salvati, Philippe de Groote |
On the Complexity of Higher-Order Matching in the Linear lambda-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings, pp. 234-245, 2003, Springer, 3-540-40254-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Norman Ramsey, Avi Pfeffer |
Stochastic lambda calculus and monads of probability distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, OR, USA, January 16-18, 2002, pp. 154-165, 2002, ACM, 1-58113-450-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Peter Sestoft |
Demonstrating Lambda Calculus Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Essence of Computation ![In: The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday], pp. 420-435, 2002, Springer, 3-540-00326-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
44 | C.-H. Luke Ong |
Lazy Lambda Calculus: Theories, Models and Local Structure Characterization (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 19th International Colloquium, ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings, pp. 487-498, 1992, Springer, 3-540-55719-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
44 | Michel Parigot |
On the Representation of Data in Lambda-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: CSL '89, 3rd Workshop on Computer Science Logic, Kaiserslautern, Germany, October 2-6, 1989, Proceedings, pp. 309-321, 1989, Springer, 3-540-52753-2. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
44 | Paula Severi, Fer-Jan de Vries |
Order Structures on Böhm-Like Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings, pp. 103-118, 2005, Springer, 3-540-28231-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Harry G. Mairson |
From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings, pp. 2-17, 2002, Springer, 3-540-00225-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Frédéric Lang, Pierre Lescanne, Luigi Liquori |
A Framework for Defining Object-Calculi. ![Search on Bibsonomy](Pics/bibsonomy.png) |
World Congress on Formal Methods ![In: FM'99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999, Proceedings, Volume II, pp. 963-982, 1999, Springer, 3-540-66588-9. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Design of functional and imperative object-oriented languages, memory management, operational semantics, implementation issues |
44 | Mitchell Wand |
Embedding Type Structure in Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, New Orleans, Louisiana, USA, January 1985, pp. 1-6, 1985, ACM Press, 0-89791-147-4. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
42 | Horatiu Cirstea, Claude Kirchner, Luigi Liquori |
Matching Power. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001, Proceedings, pp. 77-92, 2001, Springer, 3-540-42117-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
41 | Tillmann Rendel, Klaus Ostermann, Christian Hofer |
Typed self-representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2009, Dublin, Ireland, June 15-21, 2009, pp. 293-303, 2009, ACM, 978-1-60558-392-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
self interpretation, reflection, types, lambda calculus, language design |
41 | Pierre-Louis Curien, Roberto Di Cosmo |
A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings, pp. 291-302, 1991, Springer, 3-540-54233-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
41 | Daniel J. Dougherty |
Adding Algebraic Rewriting to the Untyped Lambda Calculus (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings, pp. 37-48, 1991, Springer, 3-540-53904-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
40 | José Espírito Santo, Ralph Matthes, Luís Pinto 0001 |
Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Struct. Comput. Sci. ![In: Math. Struct. Comput. Sci. 29(8), pp. 1092-1124, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
40 | José Espírito Santo, Ralph Matthes, Luís Pinto 0001 |
Inhabitation in Simply-Typed Lambda-Calculus through a Lambda-Calculus for Proof Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1604.02086, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
40 | Tom Gundersen, Willem Heijltjes, Michel Parigot |
Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013, pp. 311-320, 2013, IEEE Computer Society, 978-1-4799-0413-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
40 | Damiano Mazza |
An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25-28, 2012, pp. 471-480, 2012, IEEE Computer Society, 978-1-4673-2263-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
40 | Chitta Baral, Marcos Alvarez Gonzalez, Aaron Gottesman |
The Inverse Lambda Calculus Algorithm for Typed First Order Logic Lambda Calculus and Its Application to Translating English to FOL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Correct Reasoning ![In: Correct Reasoning - Essays on Logic-Based AI in Honour of Vladimir Lifschitz, pp. 40-56, 2012, Springer, 978-3-642-30742-3. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
40 | Ken-etsu Fujita |
An interpretation of [lambda][mu]-calculus in [lambda]-calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 84(5), pp. 261-264, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Andrea Asperti, Juliusz Chroboczek |
Safe Operators: Brackets Closed Forever Optimizing Optimal lambda-Calculus Implementations - Optimizing Optimal lambda-Calculus Implementations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 8(6), pp. 437-468, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Optimal reduction, Functional programming, Sharing |
40 | Jean-Jacques Lévy |
An Algebraic Interpretation of the lambda beta K-Calculus; and an Application of a Labelled lambda -Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 2(1), pp. 97-114, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
40 | Eike Ritter |
Characterising Explicit Substitutions which Preserve Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings, pp. 325-339, 1999, Springer, 3-540-65763-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
40 | Patrick Baillot, Kazushige Terui |
Light Types for Polynomial Time Computation in Lambda-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14-17 July 2004, Turku, Finland, Proceedings, pp. 266-275, 2004, IEEE Computer Society, 0-7695-2192-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Andreas Abel 0001, Thorsten Altenkirch |
A Predicative Strong Normalisation Proof for a lambda-Calculus with Interleaving Inductive Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TYPES ![In: Types for Proofs and Programs, International Workshop TYPES'99, Lökeberg, Sweden, June 12-16, 1999, Selected Papers, pp. 21-40, 1999, Springer, 3-540-41517-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
40 | Kwanghoon Choi 0001, Atsushi Ohori |
A Type Theory for Krivine-Style Evaluation and Compilation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems: Second Asian Symposium, APLAS 2004, Taipei, Taiwan, November 4-6, 2004. Proceedings, pp. 213-228, 2004, Springer, 3-540-23724-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Daniel J. Dougherty, Tomasz Wierzbicki |
A Decidable Variant of Higher Order Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002, Proceedings, pp. 340-351, 2002, Springer, 3-540-43916-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Val Tannen, Jean H. Gallier |
Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings, pp. 137-150, 1989, Springer, 3-540-51371-X. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
37 | Jeremy G. Siek, Ronald Garcia, Walid Taha |
Exploring the Design Space of Higher-Order Casts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESOP ![In: Programming Languages and Systems, 18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pp. 17-31, 2009, Springer, 978-3-642-00589-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
37 | Marcelo P. Fiore |
Mathematical Models of Computational and Combinatorial Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 8th International Conference, FOSSACS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings, pp. 25-46, 2005, Springer, 3-540-25388-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Didier Rémy |
Projective ML. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LISP and Functional Programming ![In: Proceedings of the Conference on Lisp and Functional Programming, LFP 1992, San Francisco, California, USA, 22-24 June 1992., pp. 66-75, 1992, ACM, 0-89791-481-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
ML |
36 | Ugo Dal Lago |
The geometry of linear higher-order recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 10(2), pp. 8:1-8:38, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
higher-order recursion, type systems, lambda calculus, implicit computational complexity, Geometry of interaction |
36 | Colin Stirling |
Dependency Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pp. 92-106, 2009, Springer, 978-3-642-00595-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
binding terms, Tree automata, typed lambda calculus |
36 | Makoto Tatsuta |
Types for Hereditary Permutators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 83-92, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hereditary permutator, infinite lambda-calculus, stream type, intersection type |
36 | Jean-Pierre Jouannaud, Albert Rubio |
Polymorphic higher-order recursive path orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 54(1), pp. 2:1-2:48, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Automated termination prover tool, Gödel's polymorphic recursor, higher-order rewriting, termination orderings, typed lambda calculus |
36 | Vasileios Koutavas, Mitchell Wand |
Small bisimulations for reasoning about higher-order imperative programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2006, Charleston, South Carolina, USA, January 11-13, 2006, pp. 141-152, 2006, ACM, 1-59593-027-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
higher-order procedures, bisimulations, lambda-calculus, imperative languages, contextual equivalence |
36 | Colin Stirling |
A Game-Theoretic Approach to Deciding Higher-Order Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II, pp. 348-359, 2006, Springer, 3-540-35907-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
higher-order matching, Games, typed lambda calculus |
36 | Christian Urban, Stefan Berghofer |
A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, pp. 498-512, 2006, Springer, 3-540-37187-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Lambda-calculus, proof assistants, nominal logic, primitive recursion |
36 | Colin Stirling |
Higher-Order Matching and Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings, pp. 119-134, 2005, Springer, 3-540-28231-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
higher-order matching, games, typed lambda calculus |
36 | Klaus Aehlig, Helmut Schwichtenberg |
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000, pp. 84-91, 2000, IEEE Computer Society, 0-7695-0725-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
affine linear typing, polynomial time computation, lambda-calculus |
36 | John Power, Edmund Robinson |
Logical Relations and Data Abstraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings, pp. 497-511, 2000, Springer, 3-540-67895-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
cartesian closed fibrations, interpretations, lambda calculus, logical relations |
36 | David R. Lester, Sava Mintchev |
Towards Machine-Checked Compiler Correctness for Higher-order Pure Functional Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers, pp. 369-381, 1994, Springer, 3-540-60017-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Congruence Proof, Lambda Calculus, Denotational Semantics, Theorem Prover, Compiler Correctness |
36 | Uday S. Reddy |
Higher-order Aspects of Logic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ELP ![In: Extensions of Logic Programming, 4th International Workshop, ELP'93, St. Andrews, UK, March 29 - April 1, 1993, Proceedings, pp. 301-321, 1993, Springer, 3-540-58025-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Higher-order features, semantics, functional programming, types, lambda calculus, concurrent logic programming, logic variables |
36 | Michael V. Mannino, Injun Choi, Don S. Batory |
The Object-Oriented Functional Data Language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 16(11), pp. 1258-1272, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
object-oriented functional data language, interactive strongly typed database programming language, O/sup 2/FDL, equational notation, strong typing, type restrictions, type variables, function interfaces, monotonic subtype rule, function redefinition, extended lambda -calculus, software engineering, software engineering, object oriented programming, object-oriented programming, functional programming, inheritance, operational semantics, object-oriented languages, relational algebra, encapsulation, high level languages, denotational semantics |
36 | Brent Hailpern, Tien Huynh, György E. Révész |
Comparing Two Functional Programming Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(5), pp. 532-542, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
functional programming systems, graph reduction interpreter, DEL-style intermediate instruction set architecture, performance evaluation, benchmarks, functional programming, lambda calculus, functional languages, high level languages, execution times, performance comparison, FP, evaluation strategies, implementation language |
36 | Jai Prakash Gupta, Stephen C. Winter, Derek R. Wilson |
CTDNet-A Mechanism for the Concurrent Execution of Lambda Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(11), pp. 1357-1367, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
CTDNet, lambda graphs, data-driven reduction machine, applicative functional programs, lambda calculus expressions, binary-tree-structured process graphs, ancestor, master processes, slave processes, distributed eager evaluation scheme, conditional expressions, distributed string reduction, parallel programmingas, graph theory, children, parallel machines, pointers, concurrent execution, neighbors |
36 | Manfred Schmidt-Schauß, Elena Machkasova |
A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings, pp. 321-335, 2008, Springer, 978-3-540-70588-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Marco Pedicini, Francesco Quaglia |
PELCR: Parallel environment for optimal lambda-calculus reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 8(3), pp. 14, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
optimal reduction, virtual reduction, Functional programming, linear logic, parallel implementation, geometry of interaction |
36 | Sergei N. Artëmov, Eduardo Bonelli |
The Intensional Lambda Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings, pp. 12-25, 2007, Springer, 978-3-540-72732-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Markus Lumpe |
A Lambda Calculus with Forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SC@ETAPS ![In: Software Composition - 4th International Workshop, SC@ETAPS 2005, Edinburgh, UK, April 9, 2005, Revised Selected Papers, pp. 83-98, 2005, Springer, 3-540-28748-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Joachim Niehren, Jan Schwinghammer, Gert Smolka |
A Concurrent Lambda Calculus with Futures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FroCoS ![In: Frontiers of Combining Systems, 5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005, Proceedings, pp. 248-263, 2005, Springer, 3-540-29051-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Viviana Bono, Michele Bugliesi, Luigi Liquori |
A Lambda Calculus of Incomplete Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings, pp. 218-229, 1996, Springer, 3-540-61550-4. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
36 | Roberto Di Cosmo, Delia Kesner |
Rewriting with Extensional Polymorphic Lambda-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 9th International Workshop, CSL '95, Annual Conference of the EACSL, Paderborn, Germany, September 22-29, 1995, Selected Papers, pp. 215-232, 1995, Springer, 3-540-61377-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
36 | Viviana Bono, Luigi Liquori |
A Subtyping for the Fisher-Honsell-Mitchell Lambda Calculus of Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers, pp. 16-30, 1994, Springer, 3-540-60017-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
36 | David Sands 0001, Jörgen Gustavsson, Andrew Moran |
Lambda Calculi and Linear Speedups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Essence of Computation ![In: The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday], pp. 60-84, 2002, Springer, 3-540-00326-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Richard Statman |
On Cartesian Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers, pp. 446-459, 1996, Springer, 3-540-63172-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
36 | Serge Abiteboul, Gerd G. Hillebrand |
Space Usage in Functional Query Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT'95, 5th International Conference, Prague, Czech Republic, January 11-13, 1995, Proceedings, pp. 439-454, 1995, Springer, 3-540-58907-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
35 | Michael Beeson |
Lambda Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning - Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004, Proceedings, pp. 460-474, 2004, Springer, 3-540-22345-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Kazuto Tominaga, Tomoya Suzuki, Kazuhiro Oka |
An Encoding Scheme for Generating lambda-Expressions in Genetic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation - GECCO 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003. Proceedings, Part II, pp. 1814-1815, 2003, Springer, 3-540-40603-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Daisuke Kimura, Makoto Tatsuta |
Dual Calculus with Inductive and Coinductive Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, Proceedings, pp. 224-238, 2009, Springer, 978-3-642-02347-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Yves Bertot |
A Short Presentation of Coq. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008. Proceedings, pp. 12-16, 2008, Springer, 978-3-540-71065-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Malgorzata Biernacka, Olivier Danvy |
A concrete framework for environment machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 9(1), pp. 6, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
closures, derivation, Abstract machines, explicit substitutions |
32 | José Espírito Santo |
Delayed Substitutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings, pp. 169-183, 2007, Springer, 978-3-540-73447-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Frédéric Loulergue |
A calculus of functional BSP programs with projection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), Proceedings, 25-29 April 2006, Rhodes Island, Greece, 2006, IEEE. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Naoki Kobayashi 0001 |
A Partially Deadlock-Free Typed Process Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997, pp. 128-139, 1997, IEEE Computer Society, 0-8186-7925-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
32 | José Meseguer 0001 |
Relating Models of Polymorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, USA, January 11-13, 1989, pp. 228-241, 1989, ACM Press, 0-89791-294-2. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
32 | Adam Chlipala |
A certified type-preserving compiler from lambda calculus to assembly language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, San Diego, California, USA, June 10-13, 2007, pp. 54-65, 2007, ACM, 978-1-59593-633-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
denotational semantics, dependent types, compiler verification, interactive proof assistants |
32 | Peter Selinger, Benoît Valiron |
A Lambda Calculus for Quantum Computation with Classical Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings, pp. 354-368, 2005, Springer, 3-540-25593-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Aleksy Schubert |
A Self-dependency Constraint in the Simply Typed Lambda Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 352-364, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 1386 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|