Result 1 to 20 of 35 total
Classical call-by-need sequent calculi: the unity of semantic artifacts. (English)
Schrijvers, Tom (ed.) et al., Functional and logic programming. 11th international symposium, FLOPS 2012, Kobe, Japan, May 23‒25, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29821-9/pbk). Lecture Notes in Computer Science 7294, 32-46 (2012).
1
Classical call-by-need and duality. (English)
Ong, Luke (ed.), Typed lambda calculi and applications. 10th international conference, TLCA 2011, Novi Sad, Serbia, June 1‒3, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21690-9/pbk; 978-3-642-21691-6/ebook). Lecture Notes in Computer Science 6690, 27-44 (2011).
2
Classical call-by-need and duality (English)
TLCA, 27-44 (2011).
3
Kripke models for classical logic. (English)
Ann. Pure Appl. Logic 161, No. 11, 1367-1378 (2010).
4
Equality is typable in semi-full pure type systems (English)
LICS, 21-30 (2010).
5
An intuitionistic logic that proves Markov’s principle (English)
LICS, 50-56 (2010).
6
Abstract machines for dialogue games. (English)
Curien, Pierre-Louis et al., Interactive models of computation and program behavior. Paris: Société Mathématique de France (SMF) (ISBN 978-2-85629-273-0/pbk). Panoramas et Synthèses 27, 231-275 (2009).
7
Kripke models for classical logic. (English)
Comput. Res. Repos. 2009, Article No. 0904.0071 (2009).
8
Interactive models of computation and program behavior. (English)
Panoramas et Synthèses 27. Paris: Société Mathématique de France (SMF) (ISBN 978-2-85629-273-0/pbk). xvi, 275~p. EUR~48.00; \$~72.00 (2009).
9
A type-theoretic foundation of delimited continuations. (English)
High.-Order Symb. Comput. 22, No. 3, 233-273 (2009).
10
An operational account of call-by-value minimal and classical $λ$-calculus in “natural deduction” form. (English)
Curien, Pierre-Louis (ed.), Typed lambda calculi and applications. 9th international conference, TLCA 2009, Brasilia, Brazil, July 1‒3, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02272-2/pbk). Lecture Notes in Computer Science 5608, 142-156 (2009).
11
Forcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus. (English)
Ono, Hiroakira (ed.) et al., Logic, language, information and computation. 16th international workshop, WoLLIC 2009, Tokyo, Japan, June 21‒24, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02260-9/pbk). Lecture Notes in Computer Science 5514. Lecture Notes in Artificial Intelligence, 209-217 (2009).
12
A new elimination rule for the calculus of inductive constructions. (English)
Berardi, Stefano (ed.) et al., Types for proofs and programs. International conference, TYPES 2008, Torino, Italy, March 26‒29, 2008. Revised selected papers. Berlin: Springer (ISBN 978-3-642-02443-6/pbk). Lecture Notes in Computer Science 5497, 32-48 (2009).
13
An operational account of call-by-value minimal and classical lambda-calculus in "natural deduction" form (English)
TLCA, 142-156 (2009).
14
Forcing-based cut-elimination for gentzen-style intuitionistic sequent calculus (English)
WoLLIC, 209-217 (2009).
15
Control reduction theories: The benefit of structural substitution. (English)
J. Funct. Program. 18, No. 3, 373-419 (2008).
16
An approach to call-by-name delimited continuations (English)
POPL, 383-394 (2008).
17
A new elimination rule for the calculus of inductive constructions (English)
TYPES, 32-48 (2008).
18
Abstract machines for dialogue games. (English)
Comput. Res. Repos. 2007, Article No. 0706.2544 (2007).
19
A proof-theoretic foundation of abortive continuations. (English)
High.-Order Symb. Comput. 20, No. 4, 403-429 (2007).
20
Result 1 to 20 of 35 total
Start
Contact
Print
General Help
