Sciweavers

Share
9 search results - page 1 / 2
» Proving language inclusion and equivalence by coinduction
Sort
View
IANDC
2016
89views Biometrics» more  IANDC 2016»
4 years 4 months ago
Proving language inclusion and equivalence by coinduction
Language equivalence and inclusion can be checked coinductively by establishing a (bi)simulation on suitable deterministic automata. In this paper we present an enhancement of thi...
Jurriaan Rot, Marcello M. Bonsangue, Jan Rutten
ESOP
2006
Springer
9 years 11 months ago
Coinductive Big-Step Operational Semantics
Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to d...
Xavier Leroy
ITA
2007
153views Communications» more  ITA 2007»
9 years 7 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
CALCO
2005
Springer
109views Mathematics» more  CALCO 2005»
10 years 1 months ago
Final Semantics for Event-Pattern Reactive Programs
Event-pattern reactive programs are front-end programs for distributed reactive components that preprocess an incoming stream of event stimuli. Their purpose is to recognize tempor...
César Sánchez, Henny B. Sipma, Matte...
CORR
2012
Springer
232views Education» more  CORR 2012»
8 years 3 months ago
A Formal Comparison of Approaches to Datatype-Generic Programming
-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed...
José Pedro Magalhães, Andres Lö...
books