Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Miculan, Marino - Dipartimento di Matematica e Informatica, Università degli Studi di Udine
A Unifying Model of Variables and Names Marino Miculan1
An axiomatic approach to metareasoning on nominal algebras in HOAS
IMPLEMENTAZIONE DI MEMORIA DISTRIBUITA SU CLUSTER COMPACTPCI
A NATURAL DEDUCTION STYLE PROOF SYSTEM FOR PROPOSITIONAL -CALCULUS AND ITS FORMALIZATION
Towards a general framework for metareasoning on HOAS encodings 1 Project TOSCA
Directed Bigraphs Davide Grohmanna,1
1 Introduction In [4], Cardelli has proposed a schematic model of biological systems as three
A Unifying Approach to Recursive and Co-recursive Definitions
On the formalization of the modal -calculus in the Calculus of Inductive Constructions1
UNIVERSIT`A DEGLI STUDI DI PISA DIPARTIMENTO DI INFORMATICA
Imperative Object-based Calculi in Co-Inductive Type Theories
Electronic Communications of the EASST Volume 10 (2008)
ISSN0249-6399 de recherche
Encoding Modal Logics in Logical Frameworks Arnon Avron2
An Algebra for Directed Bigraphs Davide Grohmanna,1
Undecidability of Model checking in Brane Logic Giorgio Baccia
The Expressive Power of Structural Operational Semantics
A Framework for Typed HOAS and Semantics Marino Miculan
Research Report UDMI/12/2006/RR Directed Bigraphs: Theory and Applications
Implementing Spi Calculus Using Nominal Techniques
Formalizing a lazy substitution proof system for -calculus in the Calculus of Inductive Constructions
Electronic Notes in Theoretical Computer Science 58 No. 1 (2001) URL: http://www.elsevier.nl/locate/entcs/volume58.html 22 pages
TOSCA 2001 Preliminary Version The Theory of Contexts for First Order and
Electronic Communications of the EASST Volume X (2008)
A categorical model of the Fusion calculus Marino Miculan
PicNIc -Pi-calculus Non-Interference checker (Tool paper)
Reactive Systems over Directed Bigraphs Davide Grohmann Marino Miculan
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
Higher-Order Symb Comput (2006) 19:283304 DOI 10.1007/s10990-006-8749-3
Under consideration for publication in J. Functional Programming 1 Consistency of the Theory of Contexts
Translating Specifications from Nominal Logic to CIC with the Theory of Contexts
A unifying model of variables and names Marino Miculan1
Unifying Recursive and Co-recursive Definitions in Sheaf Categories
CoMeta Project Workshop Preliminary Version Some characterization results for
Electronic Notes in Theoretical Computer Science 70 No. 2 (2002) URL: http://www.elsevier.nl/locate/entcs/volume70.html 20 pages
TOSCA 2001 Preliminary Version Comparing Higher-Order Encodings
-calculus in (Co)Inductive Type Theory Furio Honsell
A Natural Deduction Approach to Dynamic Logic
Appeared in the Proceedings of the 10th LICS. 1 Modal -Types for Processes
Convegno "Il software libero in Friuli Venezia Giulia" Udine, 7 febbraio 2008
Licenze Software e Open Source
Reasoning on an Imperative Object-based Calculus in Higher Order Abstract Syntax
Research Report UDMI/26/2003/RR About permutation algebras and sheaves