Sciweavers

767 search results - page 14 / 154
» Logic for Mathematical Writing
Sort
View
CSI
2007
89views more  CSI 2007»
13 years 7 months ago
Writing and executing ODP computational viewpoint specifications using Maude
The Reference Model of Open Distributed Processing (RM-ODP) is a joint standardization effort by ITU-T and ISO/IEC for the specification of large open distributed systems. RM-ODP ...
José Raúl Romero, Antonio Vallecillo...
ITP
2010
172views Mathematics» more  ITP 2010»
13 years 11 months ago
Equations: A Dependent Pattern-Matching Compiler
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
Matthieu Sozeau
PPDP
2010
Springer
13 years 5 months ago
Permissive-nominal logic
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
Gilles Dowek, Murdoch James Gabbay
PODS
2008
ACM
120views Database» more  PODS 2008»
14 years 7 months ago
Effective characterizations of tree logics
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
Mikolaj Bojanzyk
CALCO
2011
Springer
235views Mathematics» more  CALCO 2011»
12 years 7 months ago
On the Fusion of Coalgebraic Logics
Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to trans...
Fredrik Dahlqvist, Dirk Pattinson