Sciweavers

226 search results - page 10 / 46
» Extensional Theories and Rewriting
Sort
View
94
Voted
APAL
2008
112views more  APAL 2008»
15 years 17 days ago
A domain model characterising strong normalisation
Building on previous work by Coquand and Spiwack [8] we construct a strict domaintheoretic model for the untyped -calculus with pattern matching and term rewriting which has the p...
Ulrich Berger
IANDC
2006
78views more  IANDC 2006»
15 years 13 days ago
A stable programming language
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
Luca Paolini
94
Voted
MFCS
2009
Springer
15 years 7 months ago
A General Class of Models of
Abstract. We recently introduced an extensional model of the pure λcalculus living in a cartesian closed category of sets and relations. In this paper, we provide sufficient condi...
Giulio Manzonetto
EUROMICRO
1996
IEEE
15 years 4 months ago
A Graph Rewriting Approach for Transformational Design of Digital Systems
Transformational design integrates design and verification. It combines "correctness by construciion" and design creativity by the use ofpre-proven behaviour preserving ...
Corrie Huijs
155
Voted
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 4 months ago
First-order Logic: Modality and Intensionality
Contemporary use of the term ’intension’ derives from the traditional logical Frege-Russell’s doctrine that an idea (logic formula) has both an extension and an intension. Al...
Zoran Majkic