(Enter summary)
Abstract: form of the knight's tour problem
\Is it possible for the k-th player to win?"
Solution. We have to nd a boolean function
which associates to the k-th player true if and
only if there exists the game tree and it has a
node labelled with a state which is winning for
the k-th player. The problem can be expressed
by the following type:
(8k < numP layers) fx 2 Boolj (x = true) $
(9t 2 ExpandedT ree(State; gameGraph; initState))
HasWinning(t; k)g
where
HasWinning(t; k)
(9a 2 State) (a InT... (Update)
Active bibliography (related documents): More All
0.5: Perpetual Reductions in λ-Calculus - van Raamsdonk, Severi.. (1999)
(Correct)
0.0: Type-Theoretic Methodology For Practical Programming Languages - Crary (1998)
(Correct)
0.0: The Structure of Nuprl's Type Theory - Constable (1997)
(Correct)
Similar documents based on text: More All
0.3: Inductively Generated Formal Topologies - Coquand, Sambin, Smith, Valentini
(Correct)
0.3: A Bottom-up Semantics for Constructive Negation - Bossi, Fabris, Meo (1994)
(Correct)
0.3: A Characterization of 0,±1 Perfect Matrices in.. - De Francesco, Nobili
(Correct)
BibTeX entry: (Update)
@misc{ valentini-lambdacalcolo,
author = "Silvio Valentini",
title = "Lambda-Calcolo E Teoria Dei Tipi",
url = "citeseer.ist.psu.edu/499117.html" }
Citations (may not include all citations):
210
its Syntax and Semantics (context) - Barendregt
64
Metamathematical investigations of a calculus of constructio.. (context) - Coquand - 1990
39
A non-type-theoretic semantics for a typetheoretic language (context) - Allen - 1987
2
A general method to prove the normalization theorem for rst .. (context) - Capretta, Valentini
Documents on the same site (http://www.disi.unige.it/aila/scuola/):
The Axiom Of Choice And Combinatory Logic - Cantini
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC