M
Marcelo Fiore
Researcher at University of Cambridge
Publications - 97
Citations - 2713
Marcelo Fiore is an academic researcher from University of Cambridge. The author has contributed to research in topics: Lambda calculus & Process calculus. The author has an hindex of 29, co-authored 94 publications receiving 2469 citations. Previous affiliations of Marcelo Fiore include University of Sussex & McGill University.
Papers
More filters
Proceedings ArticleDOI
Abstract syntax and variable binding
TL;DR: This work develops a theory of abstract syntax with variable binding that gives a notion of initial algebra semantics encompassing the traditional one; besides compositionality, it automatically verifies the semantic substitution lemma.
Book
Axiomatic Domain Theory in Categories of Partial Maps
TL;DR: This paper presents a meta-anatomy of recursive types in Cpo-categories, an attempt to clarify the role of explicit and implicit types in the development of types for knowledge representation.
Proceedings ArticleDOI
Computing symbolic models for verifying cryptographic protocols
Marcelo Fiore,Martín Abadi +1 more
TL;DR: An algorithm that given a finite process describing a protocol in a hostile environment (trying to force the system into a "bad" state) computes a model of traces on which security properties can be checked and is sound for protocols with shared-key encryption/decryption that use arbitrary messages as keys.
Proceedings ArticleDOI
Semantic analysis of normalisation by evaluation for typed lambda calculus
TL;DR: This paper analyses the lambda definability result of Jung and Tiuryn via Kripke logical relations and shows how it can be adapted to unify definability and normalisation, yielding an extensional normalisation result.
Proceedings ArticleDOI
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
TL;DR: This work gives the first type-directed partial evaluator that constructs %able to construct normal forms of terms in this calculus and proves, using Grothendieck logical relations, that every term is equivalent to one in normal form.