Sciweavers

39 search results - page 8 / 8
» Formalising Generalised Substitutions
Sort
View
ICFP
2005
ACM
14 years 5 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
IVCNZ
1998
13 years 6 months ago
Duality Principles in Image Processing and Analysis
Duality is a well-established concept in quantum physics. It formalises the fact that what one observes is not nature in itself, but--in Heisenberg's words--"nature expo...
Luc Florack
CORR
2007
Springer
141views Education» more  CORR 2007»
13 years 5 months ago
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
Stéphane Le Roux
SCP
2010
155views more  SCP 2010»
13 years 3 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay