Result 1 to 20 of 116 total
Intersection types for the resource control lambda calculi. (English)
Cerone, Antonio (ed.) et al., Theoretical aspects of computing ‒ ICTAC 2011. 8th international colloquium, Johannesburg, South Africa, August 31‒September 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23282-4/pbk). Lecture Notes in Computer Science 6916, 116-134 (2011).
1
Intuitionistic sequent-style calculus with explicit structural rules. (English)
Bezhanishvili, Nick (ed.) et al., Logic, language, and computation. 8th international Tbilisi symposium on logic, language, and computation, TbiLLC 2009, Bakuriani, Georgia, September 21‒25, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-22302-0/pbk). Lecture Notes in Computer Science 6618. Lecture Notes in Artificial Intelligence, 101-124 (2011).
2
Intersection types for the resource control lambda calculi (English)
ICTAC, 116-134 (2011).
3
On the rationality of escalation. (English)
Comput. Res. Repos. 2010, Article No. 1004.5257 (2010).
4
On the rationality of escalation. (English)
Comput. Res. Repos. 2009, Article No. 0912.1746 (2009).
5
Feasibility/Desirability games for normal form games, choice models and evolutionary games. (English)
Comput. Res. Repos. 2009, Article No. 0907.5469 (2009).
6
Deconstruction of infinite extensive games using coinduction. (English)
Comput. Res. Repos. 2009, Article No. 0904.3528 (2009).
7
Intuitionistic sequent-style calculus with explicit structural rules (English)
TbiLLC, 101-124 (2009).
8
Conversion/Preference games. (English)
Comput. Res. Repos. 2008, Article No. 0811.0071 (2008).
9
(Mechanical) reasoning on infinite extensive games. (English)
Comput. Res. Repos. 2008, Article No. 0805.1798 (2008).
10
Computation with classical sequents. (English)
Math. Struct. Comput. Sci. 18, No. 3, 555-609 (2008).
11
Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage. (English)
Theor. Comput. Sci. 398, No. 1-3, 114-128 (2008).
12
Common knowledge logic in a higher order proof assistant? (English)
Comput. Res. Repos. 2007, Article No. 0712.3147 (2007).
13
Dynamic logic of common knowledge in a proof assistant. (English)
Comput. Res. Repos. 2007, Article No. 0712.3146 (2007).
14
Computational logic and applications, CLA ’05. Proceedings of the 3rd workshop, Chambéry, France, June 20‒21, 2005. (English)
Discrete Mathematics and Theoretical Computer Science. Proceedings AF. Nancy: The Association. Discrete Mathematics \& Theoretical Computer Science (DMTCS). ii, 107~p., electronic. (2006).
15
Rewriting game theory as a foundation for state-based models of gene regulation. (English)
Priami, Corrado (ed.), Computational methods in systems biology. International conference, CMSB 2006, Trento, Italy, October 18‒19, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-46166-1/pbk). Lecture Notes in Computer Science 4210. Lecture Notes in Bioinformatics, 257-270 (2006).
16
Mechanizing common knowledge logic using COQ. (English)
Ann. Math. Artif. Intell. 48, No. 1-2, 15-43 (2006).
17
Addressed term rewriting systems: application to a typed object calculus. (English)
Math. Struct. Comput. Sci. 16, No. 4, 667-709 (2006).
18
Review of "Alfred Tarski: life and logic by anita burdman feferman and Solomon feferman", Cambridge university press 2004 (English)
SIGACT News 37, No. 1, 27-28 (2006).
19
Rewriting game theory as a foundation for state-based models of gene regulation (English)
CMSB, 257-270 (2006).
20
Result 1 to 20 of 116 total
Start
Contact
Print
General Help
