Wave-Style Token Machines and Quantum Lambda Calculi

Particle-style token machines are a way to interpret proofs and programs, when the latter are written following the principles of linear logic. In this paper, we show that token machines also make sense when the programs at hand are those of a simple quantum lambda-calculus with implicit qubits. This, however, requires generalising the concept of a token machine to one in which more than one particle travel around the term at the same time. The presence of multiple tokens is intimately related to entanglement and allows us to give a simple operational semantics to the calculus, coherently with the principles of quantum computation.Comment: In Proceedings LINEARITY 2014, arXiv:1502.0441

Painting and Language: A Pictoral Syntax of Shapes

In previous articles, the author proposed that paintings can have syntactic rules. In this article he develops his proposal further and shows that shapes act as syntactic elements in the languages of painting styles. He meets Nelson Goodman\u27s objections to his proposal by showing that shapes meet the criterion of syntactic discreteness proposed by the latter to separate linguistic from other symbolic systems. His approach is to specify style as the domain of a language of painting, to show that style is syntactical and to argue that shapes are the primitive syntactic elements of style. His essay relates current research on the development of syntax for picture-reading machines to the question of syntax for paintings

Donors Double Down In Gaming Debate

On the final day of the 2009 legislative session, Florida lawmakers passed a law to expand gambling in the state and offer a new gambling compact to the Seminole Tribe, overcoming a legislature which has "resist[ed] gambling expansion for decades." The bill was signed by Gov. Crist on June 15. Under the new agreement, the Seminole Tribe--which has been seeking state approval for Las Vegas-style slot machines for years--would gain the exclusive right to operate slot machines outside of Miami-Dade and Broward counties. Fast Fact In 2009, Florida lawmakers passed gambling legislation offering a new deal to the Seminole Tribe. During the previous election, the Seminoles and related businesses gave $720,000, more than its combined giving during the past 10 years

Refining Nodes and Edges of State Machines

State machines are hierarchical automata that are widely used to structure complex behavioural specifications. We develop two notions of refinement of state machines, node refinement and edge refinement. We compare the two notions by means of examples and argue that, by adopting simple conventions, they can be combined into one method of refinement. In the combined method, node refinement can be used to develop architectural aspects of a model and edge refinement to develop algorithmic aspects. The two notions of refinement are grounded in previous work. Event-B is used as the foundation for our refinement theory and UML-B state machine refinement influences the style of node refinement. Hence we propose a method with direct proof of state machine refinement avoiding the detour via Event-B that is needed by UML-B