10447 search results - page 1780 / 2090 » The Philosophy of Computer Science |
175
click to vote
LICS
2007
IEEE
16 years 1 months ago
2007
IEEE
Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. The payoff received by the controller can be evaluated in different ways, dep...
172
click to vote
LICS
2007
IEEE
16 years 1 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
150
click to vote
LICS
2007
IEEE
16 years 1 months ago
2007
IEEE
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
168
Voted
LICS
2007
IEEE
16 years 1 months ago
2007
IEEE
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
158
click to vote
LICS
2007
IEEE
16 years 1 months ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...