Arrow Research search

Author name cluster

Furio Honsell

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

23 papers
2 author rows

Possible papers

23

FSCD Conference 2025 Conference Paper

Unsolvable Terms in Filter Models (Invited Talk)

  • Mariangiola Dezani-Ciancaglini
  • Paola Giannini
  • Furio Honsell

Intersection type theories (itt’s) and filter models, i. e. λ-calculus models generated by itt’s, are reviewed in full generality. In this framework, which subsumes most λ-calculus models in the literature based on Scott-continuous functions, we discuss the interpretation of unsolvable terms. We give a necessary, but not sufficient, condition on an itt for the interpretation of some unsolvable term to be non-trivial in the filter model it generates. This result is obtained building on a type theoretic characterisation of the fine structure of unsolvables.

FSCD Conference 2022 Conference Paper

On Quantitative Algebraic Higher-Order Theories

  • Ugo Dal Lago
  • Furio Honsell
  • Marina Lenisa
  • Paolo Pistone

We explore the possibility of extending Mardare et al. ’s quantitative algebras to the structures which naturally emerge from Combinatory Logic and the λ-calculus. First of all, we show that the framework is indeed applicable to those structures, and give soundness and completeness results. Then, we prove some negative results clearly delineating to which extent categories of metric spaces can be models of such theories. We conclude by giving several examples of non-trivial higher-order quantitative algebras.

LFMTP Workshop 2019 Workshop Paper

A Definitional Implementation of the Lax Logical Framework LLFP in Coq, for Supporting Fast and Loose Reasoning

  • Fabio Alessi
  • Alberto Ciaffaglione
  • Pietro Di Gianantonio
  • Furio Honsell
  • Marina Lenisa

The Lax Logical Framework, LLFP, was introduced, by a team including the last two authors, to provide a conceptual framework for integrating different proof development tools, thus allowing for external evidence and for postponing, delegating, or factoring-out side conditions. In particular, LLFP allows for reducing the number of times a proof-irrelevant check is performed. In this paper we give a shallow, actually definitional, implementation of LLFP in Coq, i. e. we use Coq both as host framework and oracle for LLFP. This illuminates the principles underpinning the mechanism of Lock-types and also suggests how to possibly extend Coq with the features of LLFP. The derived proof editor is then put to use for developing case-studies on an emerging paradigm, both at logical and implementation level, which we call fast and loose reasoning following Danielsson et alii [6]. This paradigm trades off efficiency for correctness and amounts to postponing, or running in parallel, tedious or computationally demanding checks, until we are really sure that the intended goal can be achieved. Typical examples are branch-prediction in CPUs and optimistic concurrency control.

LPAR Conference 2018 Conference Paper

The involutions-as-principal types/application-as-unification Analogy

  • Alberto Ciaffaglione
  • Furio Honsell
  • Marina Lenisa
  • Ivan Scagnetto

In 2005, S. Abramsky introduced various universal models of computation based on Affine Combinatory Logic, consisting of partial involutions over a suitable formal language of moves, in order to discuss reversible computation in a game-theoretic setting. We investigate Abramsky’s models from the point of view of the model theory of λ-calculus, focusing on the purely linear and affine fragments of Abramsky’s Combinatory Algebras. Our approach stems from realizing a structural analogy, which had not been hitherto pointed out in the literature, between the partial involution interpreting a combinator and the principal type of that term, with respect to a simple types discipline for λ-calculus. This analogy allows for explaining as unification between principal types the somewhat awkward linear application of involutions arising from Geometry of Interaction (GoI). Our approach provides immediately an answer to the open problem, raised by Abram- sky, of characterising those finitely describable partial involutions which are denotations of combinators, in the purely affine fragment. We prove also that the (purely) linear combinatory algebra of partial involutions is a (purely) linear λ-algebra, albeit not a combinatory model, while the (purely) affine combinatory algebra is not. In order to check the complex equations involved in the definition of affine λ-algebra, we implement in Erlang the compilation of λ-terms as involutions, and their execution.

LFMTP Workshop 2015 Workshop Paper

Gluing together Proof Environments: Canonical extensions of LF Type Theories featuring Locks

  • Furio Honsell
  • Luigi Liquori
  • Petar Maksimovic 0001
  • Ivan Scagnetto

We present two extensions of the LF Constructive Type Theory featuring monadic locks. A lock is a monadic type construct that captures the effect of an external call to an oracle. Such calls are the basic tool for gluing together diverse Type Theories and proof development environments. The oracle can be invoked either to check that a constraint holds or to provide a suitable witness. The systems are presented in the canonical style developed by the CMU School. The first system, CLLFP, is the canonical version of the system LLFP, presented earlier by the authors. The second system, CLLFP? , features the possibility of invoking the oracle to obtain a witness satisfying a given constraint. We discuss encodings of Fitch-Prawitz Set theory, call-by-value lambda-calculi, and systems of Light Linear Logic. Finally, we show how to use Fitch-Prawitz Set Theory to define a type system that types precisely the strongly normalizing terms.

LFMTP Workshop 2013 Invited Paper

25 years of formal proof cultures: some problems, some philosophy, bright future

  • Furio Honsell

Throughout the history of Mathematics, several different proof cultures have co-existed, and still do co-exist. After 25 years of Logical Frameworks, we can say that even as far as proof metalanguages go, a definitive system is utopian and that we are witnessing the continuous development of a diversity of formal proof cultures, see e. g. [10–12, 17, 19, 21, 23, 24, 28]. In this paper, we propose a contribution towards the clarification of some controversial issues that have arisen in the theory and practice of Logical Frameworks, and have possibly motivated such a manifold speciation. Using as a running example the encoding of the critical features of Non- Commutative Linear Logic (NCLL) [26] in the Logical Framework LFP [20], we discuss the notions of adequacy of an encoding, locality of a side-condition, deep and shallow encodings, and how to embed heterogenous justifications or external evidence in LF. This discussion naturally leads to the question of how to express formally the expressive power of a Logical Framework, a minimal requirement being that of encoding itself within itself. We focus on LFP and we discuss its relations to the original LF [17], and briefly to the Conditional LF [21], and the Pattern LF [19] previously introduced by the authors. We conclude the paper by briefly comparing LFP to λΠ-calculus modulo [12], the Linear LF [9], and the Concurrent LF[28].

MFCS Conference 2012 Conference Paper

Categories of Coalgebraic Games

  • Furio Honsell
  • Marina Lenisa
  • Rekha Redamalla

Abstract We consider a general notion of coalgebraic game, whereby games are viewed as elements of a final coalgebra. This allows for a smooth definition of game operations ( e. g. sum, negation, and linear implication) as final morphisms. The notion of coalgebraic game subsumes different notions of games, e. g. possibly non-wellfounded Conway games and games arising in Game Semantics à la [AJM00]. We define various categories of coalgebraic games and (total) strategies, where the above operations become functorial, and induce a structure of monoidal closed or *-autonomous category. In particular, we define a category of coalgebraic games corresponding to AJM-games and winning strategies, and a generalization to non-wellfounded games of Joyal’s category of Conway games. This latter construction provides a categorical characterization of the equivalence by Berlekamp, Conway, Guy on loopy games.

I&C Journal 2009 Journal Article

On the completeness of order-theoretic models of the λ-calculus

  • Furio Honsell
  • Gordon Plotkin

Scott discovered his domain-theoretic models of the λ-calculus, isomorphic to their function space, in 1969. A natural completeness problem then arises: whether any two terms equal in all Scott models are convertible. There is also an analogous consistency problem: whether every equation between two terms, consistent with the λ-calculus, has a Scott model. We consider such questions for wider sets of sentences and wider classes of models, the pointed (completely) partially ordered ones. A negative result for a set of sentences shows the impossibility of finding Scott models for that class; a positive result gives evidence that there might be enough Scott models. We find, for example, that the order-extensional pointed ω-cpo models are complete for Π 1 -sentences with positive matrices, whereas the consistency question for Σ1-sentences with equational matrices depends on the consistency of certain critical sentences asserting the existence of certain functions analogous to the generalized Mal’cev operators first considered in the context of the λ-calculus by Selinger.

LPAR Conference 2008 Conference Paper

A Conditional Logical Framework

  • Furio Honsell
  • Marina Lenisa
  • Luigi Liquori
  • Ivan Scagnetto

Abstract The Conditional Logical Framework LF K is a variant of the Harper-Honsell-Plotkin’s Edinburgh Logical Framemork LF. It features a generalized form of λ -abstraction where β -reductions fire under the condition that the argument satisfies a logical predicate. The key idea is that the type system memorizes under what conditions and where reductions have yet to fire. Different notions of β -reductions corresponding to different predicates can be combined in LF K. The framework LF K subsumes, by simple instantiation, LF (in fact, it is also a subsystem of LF!), as well as a large class of new generalized conditional λ -calculi. These are appropriate to deal smoothly with the side-conditions of both Hilbert and Natural Deduction presentations of Modal Logics. We investigate and characterize the metatheoretical properties of the calculus underpinning LF K, such as subject reduction, confluence, strong normalization.

TCS Journal 2008 Journal Article

A type assignment system for game semantics

  • Pietro Di Gianantonio
  • Furio Honsell
  • Marina Lenisa

We present a type assignment system that provides a finitary interpretation of lambda terms in a game semantics model. Traditionally, type assignment systems describe the semantic interpretation of terms in domain-theoretic models. Quite surprisingly, the type assignment system presented in this paper is very similar to the traditional ones, the main difference being the omission of the subtyping rules.

TCS Journal 2003 Journal Article

A category of compositional domain-models for separable Stone spaces

  • Fabio Alessi
  • Paolo Baldan
  • Furio Honsell

In this paper we introduce SFP M, a category of SFP domains which provides very satisfactory domain-models, i. e. “partializations”, of separable Stone spaces (2-Stone spaces). More specifically, SFP M is a subcategory of SFP ep, closed under direct limits as well as many constructors, such as lifting, sum, product and Plotkin powerdomain (with the notable exception of the function space constructor). SFP M is “structurally well behaved”, in the sense that the functor MAX, which associates to each object of SFP M the Stone space of its maximal elements, is compositional with respect to the constructors above, and ω-continuous. A correspondence can be established between these constructors over SFP M and appropriate constructors on Stone spaces, whereby SFP M domain-models of Stone spaces defined as solutions of a vast class of recursive equations in SFP M, can be obtained simply by solving the corresponding equations in SFP M. Moreover any continuous function between two 2-Stone spaces can be extended to a continuous function between any two SFP M domain-models of the original spaces. The category SFP M does not include all the SFP's with a 2-Stone space of maximal elements (CSFP's). We show that the CSFP's can be characterized precisely as suitable retracts of SFP M objects. Then the results proved for SFP M easily extends to the wider category having CSFP's as objects. Using SFP M we can provide a plethora of “partializations” of the space of finitary hypersets (the hyperuniverse N ω (Ann. New York Acad. Sci. 806 (1996) 140). These includes the classical ones proposed in Abramsky (A Cook's tour of the finitary non-well-founded sets unpublished manuscript, 1988; Inform. Comput. 92(2) (1991) 161) and Mislove et al. (Inform. Comput. 93(1) (1991) 16), which are also shown to be non-isomorphic, thus providing a negative answer to a problem raised in Mislove et al.

LPAR Conference 2003 Conference Paper

Strict Geometry of Interaction Graph Models

  • Furio Honsell
  • Marina Lenisa
  • Rekha Redamalla

We study a class of “wave-style” Geometry of Interaction (GoI) λ -models based on the category Rel of sets and relations. Wave GoI models arise when Abramsky’s GoI axiomatization, which generalizes Girard’s original GoI, is applied to a traced monoidal category with the categorical product as tensor, using “countable power” as the traced strong monoidal functor! . Abramsky hinted that the category Rel is the basic setting for traditional denotational “static semantics”. However, Rel, together with the cartesian product, apparently escapes Abramsky’s original GoI construction. Here we show that Rel can be axiomatized as a strict GoI situation, i. e. a strict variant of Abramsky’s GoI situation, which gives rise to a rich class of strict graph models. These are models of restrictedλ -calculi in the sense of [HL99], such as Church’s λ -I-calculus and the λβ KN -calculus.

I&C Journal 2002 Journal Article

Prelogical Relations

  • Furio Honsell
  • Donald Sannella

We study a weakening of the notion of logical relations, called prelogical relations, that has many of the features that make logical relations so useful as well as further algebraic properties including composability. The basic idea is simply to require the reverse implication in the definition of logical relations to hold only for pairs of functions that are expressible by the same lambda term. Prelogical relations are the minimal weakening of logical relations that gives composability for extensional structures and simultaneously the most liberal definition that gives the Basic Lemma. Prelogical predicates (i. e. , unary prelogical relations) coincide with sets that are invariant under Kripke logical relations with varying arity as introduced by Jung and Tiuryn, and prelogical relations are the closure under projection and intersection of logical relations. These conceptually independent characterizations of prelogical relations suggest that the concept is rather intrinsic and robust. The use of prelogical relations gives an improved version of Mitchell's representation independence theorem which characterizes observational equivalence for all signatures rather than just for first-order signatures. Prelogical relations can be used in place of logical relations to give an account of data refinement where the fact that prelogical relations compose explains why stepwise refinement is sound.

TCS Journal 2001 Journal Article

π-calculus in (Co)inductive-type theory

  • Furio Honsell
  • Marino Miculan
  • Ivan Scagnetto

We present a large and we think also significant case study in computer assisted formal reasoning. We start by giving a higher-order abstract syntax encoding of π-calculus in the higher-order inductive/coinductive-type theories CIC and CC (Co)Ind. This encoding gives rise to a full-fledged proof editor/proof assistant for the π-calculus, once we embed it in Coq, an interactive proof-development environment for CC (Co)Ind. Using this computerized assistant we prove formally a substantial chapter of the theory of strong late bisimilarity, which amounts essentially to Section 2 of A calculus of mobile processes by Milner, Parrow, and Walker. This task is greatly simplified by the use of higher-order syntax. In fact, not only we can delegate conveniently to the metalanguage α-conversion and substitution, but, introducing a suitable axiomatization of the theory of contexts, we can accommodate also the machinery for generating new names. The axiomatization we introduce is quite general and should be easily portable to other formalizations based on higher-order syntax. The use of coinductive types and corresponding tactics allows to give alternative, and possibly more natural, proofs of many properties of strong late bisimilarity, w. r. t. those originally given by Milner, Parrow, and Walker.

MFCS Conference 2000 Conference Paper

Compositional Characterizations of lambda-Terms Using Intersection Types

  • Mariangiola Dezani-Ciancaglini
  • Furio Honsell
  • Yoko Motohama

Abstract We show how to characterize compositionally a number of evaluation properties of λ-terms using Intersection Type assignment systems. In particular, we focus on termination properties, such as strong normalization, normalization, head normalization, and weak head normalization. We consider also the persistent versions of such notions. By way of example, we consider also another evaluation property, unrelated to termination, namely reducibility to a closed term. Many of these characterization results are new, to our knowledge, or else they streamline, strengthen, or generalize earlier results in the literature. The completeness parts of the characterizations are proved uniformly for all the properties, using a set-theoretical semantics of intersection types over suitable kinds of stable sets. This technique generalizes Krivine’s and Mitchell’s methods for strong normalization to other evaluation properties.

CSL Conference 1999 Conference Paper

Pre-logical Relations

  • Furio Honsell
  • Donald Sannella

Abstract We study a weakening of the notion of logical relations, called pre-logical relations, that has many of the features that make logical relations so useful as well as further algebraic properties including composability. The basic idea is simply to require the reverse implication in the definition of logical relations to hold only for pairs of functions that are expressible by the same lambda term. Pre-logical relations are the minimal weakening of logical relations that gives composability for extensional structures and simultaneously the most liberal definition that gives the Basic Lemma. The use of pre-logical relations in place of logical relations gives an improved version of Mitchell’s representation independence theorem which characterizes observational equivalence for all signatures rather than just for first-order signatures. Pre-logical relations can be used in place of logical relations to give an account of data refi- nement where the fact that pre-logical relations compose explains why stepwise refinement is sound.

TCS Journal 1999 Journal Article

Semantical analysis of perpetual strategies in λ-calculus

  • Furio Honsell
  • Marina Lenisa

Perpetual strategies in λ-calculus are analyzed from a semantical perspective. This is achieved using suitable denotational models, computationally adequate with respect to the observational (operational) equivalence, ≈ p, induced by perpetual strategies. A necessary and sufficient condition is given for an ω-algebraic lattice, isomorphic to the space of its strict continuous self-maps, to be computationally adequate w. r. t. ≈ p. While many such models exist, it is shown, however, that none is fully abstract w. r. t. ≈ p. The computationally adequate lattice model Dp is studied in detail. It is used to give a semantical proof of the Conservation Theorem for the λ-calculus, and to provide coinductive and mixed inductive-coinductive characterizations of ≈ p. The coinductive characterization allows to show that the term model of ≈ p is a denotational model; this yields a new characterization of perpetual redexes in λ-calculus.

TCS Journal 1996 Journal Article

A general construction of hyperuniverses

  • Marco Forti
  • Furio Honsell

Structures exhibiting strong comprehension properties have been utilized in different fields of Mathematical Logic and Theoretical Computer Science. Although the techniques employed and the intended applications are quite different, these structures are essentially alike. Starting from a general definition of Hyperuniverse, we present here a comprehensive framework for investigating these structures. We also give a procedure for constructing Hyperuniverses which encompasses all known examples and provides many new non-ε-isomorphic and even nonhomeomorphic structures.

MFCS Conference 1994 Conference Paper

Processes and Hyperuniverses

  • Michael Forti
  • Furio Honsell
  • Marina Lenisa

Abstract We show how to define domains of processes, which arise in the denotational semantics of concurrent languages, using hypersets, i. e. non-wellfounded sets. In particular we discuss how to solve recursive equations involving set-theoretic operators within hyperuniverses with atoms. Hyperuniverses are transitive sets which carry a uniform topological structure and include as a clopen subset their exponential space (i. e. the set of their closed subsets) with the exponential uniformity. This approach allows to solve many recursive domain equations of processes which cannot be even expressed in standard Zermelo-Fraenkel Set Theory, e. g. when the functors involved have negative occurrences of the argument. Such equations arise in the semantics of concurrrent programs in connection with function spaces and higher order assignment. Finally, we briefly compare our results to those which make use of complete metric spaces, due to de Bakker, America and Rutten.

MFCS Conference 1993 Invited Paper

Some Results on the Full Abstraction Problem for Restricted Lambda Calculi

  • Furio Honsell
  • Marina Lenisa

Abstract Issues in the mathematical semantics of two restrictions of the λ-calculus, i. e. λ I -calculus and λ v -calculus, are discussed. A fully abstract model for the natural evaluation of the former is defined using complete partial orders and strict Scott-continuous functions. A correct, albeit non- fully abstract, model for the SECD evaluation of the latter is denned using Girard's coherence spaces and stable functions. These results are used to illustrate the interest of the analysis of the fine structure of mathematical models of programming languages.

v2026.09.13