Furio Honsell

Furio Honsell

Auto-generated profile, based on publicly available information

Furio Honsell

Università di Udine

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 1999 in Theoretical Computer Science
Verified
Journal Article
Closed access
PDF file
FHFurio Honsell
Furio Honsell
MLMarina Lenisa
Marina Lenisa

14 March 2019 in New Media & Society
Verified
Journal Article
Closed access
PDF file
LFLeopoldina Fortunati
Leopoldina Fortunati
AMAnna Maria Manganelli
Anna Maria Manganelli
Filippo CavalloFilippo Cavallo
Filippo Cavallo
FHFurio Honsell
Furio Honsell
Given that today 60% of Internet traffic is generated by bots, ‘CAPTCHA’ (Completely Automated Public Turing Test to tell Computers and Humans Apart) tests that are supposedly impossible to be done by robots have been introduced. What are the cognitive and emotional effects of these tests on Internet users? Does this request to demonstrate they are not a robot affect users’ identity as human beings? To answer these questions, we selected two groups (117 and 116 respondents, respectively). An online questionnaire that differed only in the task was proposed: we asked the first group to complete some CAPTCHA tests, and the second group to complete some logic tests. In addition to other questions in both versions, we introduced the TLX scale (NASA). Preliminary results show that CAPTCHA execution is associated with feelings of alienation and that the user’s self-perception of humanity is influenced by the execution of the two different types of test.

1 January 1995
Verified
Book Chapter
Closed access
PDF file
FHFurio Honsell
Furio Honsell
MLMarina Lenisa
Marina Lenisa

31 July 2003 in Electronic Notes in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
DCDaniela Cancila
Daniela Cancila
FHFurio Honsell
Furio Honsell
MLMarina Lenisa
Marina Lenisa
Coiterative functions can be explained categorically as final coalgebraic morphisms, once coinductive types are viewed as final coalgebras. However, the coiteration schema which arises in this way is too rigid to accommodate directly many interesting classes of circular specifications. In this paper, building on the notion of T-coiteration introduced by the third author and capitalizing on recent work on bialgebras by Turi-Plotkin and Bartels, we introduce and illustrate various generalized coiteration patterns. First we show that, by choosing the appropriate monad T, T-coiteration captures naturally a wide range of coiteration schemata, such as the duals of primitive recursion and course-of-value iteration, and mutual coiteration. Then we show that, in the more structured categorical setting of bialgebras, T-coiteration captures guarded coiterations schemata, i.e. specifications where recursive calls appear guarded by predefined algebraic operations.

27 September 2005
Verified
Conference Paper
Open access
MMMarino Miculan
Marino Miculan
ISIvan SCAGNETTO
Ivan SCAGNETTO
FHFurio Honsell
Furio Honsell
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction style proof system for intuitionistic nominal logic, called NINL, inspired by a sequent proof system recently proposed by J. Cheney. We present a translation of terms, formulas and judgments of NINL, into terms and propositions of CIC, via a weak HOAS encoding. It turns out that the (translation of the) axioms and rules of NINL are derivable in CIC extended with the Theory of Contexts (CIC/ToC), and that in the latter we can prove also sequents which are not derivable in NINL. Thus, CIC/ToC can be seen as a strict extension of NINL. Copyright © 2005 ACM

1 August 1999 in Mathematical Structures in Computer Science
Verified
Journal Article
Closed access
PDF file
FHFurio Honsell
Furio Honsell
MLMarina Lenisa
Marina Lenisa
We discuss new ways of characterizing, as maximal fixed points of monotone operators, observational congruences on λ-terms and, more generally, equivalences on applicative structures. These characterizations naturally induce new forms of coinduction principles for reasoning on program equivalences, which are not based on Abramsky's applicative bisimulation. We discuss, in particular, what we call the cartesian coinduction principle, which arises when we exploit the elementary observation that functional behaviours can be expressed as cartesian graphs. Using the paradigm of final semantics, the soundness of this principle over an applicative structure can be expressed easily by saying that the applicative structure can be construed as a strongly extensional coalgebra for the functor ([Pscr ](- × -))[oplus ]([Pscr ](- × -)). In this paper we present two general methods for showing the soundness of this principle. The first applies to approximable applicative structures – many CPO λ-models in the literature and the corresponding quotient models of indexed terms turn out to be approximable applicative structures. The second method is based on Howe's congruence candidates, which applies to many observational equivalences. Structures satisfying cartesian coinduction are precisely those applicative structures that can be modelled using the standard set-theoretic application in non-wellfounded theories of sets, where the Foundation Axiom is replaced by the Axiom X1 of Forti and Honsell.