A5023086477- Advanced Database Systems and Queries
- Logic, programming, and type systems
- Semantic Web and Ontologies
- Logic, Reasoning, and Knowledge
- Data Management and Algorithms
- Formal Methods in Verification
- Distributed systems and fault tolerance
- Advanced Data Storage Technologies
- Natural Language Processing Techniques
- Distributed and Parallel Computing Systems
- Peer-to-Peer Network Technologies
- Algorithms and Data Compression
- Scientific Computing and Data Management
- Service-Oriented Architecture and Web Services
- semigroups and automata theory
- Parallel Computing and Optimization Techniques
- Software Engineering Research
- Advanced Software Engineering Methodologies
- Security and Verification in Computing
- Data Quality and Management
- Model-Driven Software Engineering Techniques
- Advanced Mathematical Theories and Applications
- Computability, Logic, AI Algorithms
- Advanced Algebra and Logic
- Cryptography and Data Security
University of Pisa
2011-2024
Centre National de la Recherche Scientifique
1994-1995
Polish Academy of Sciences
1993
Institute of Computer Science
1993
Cornell University
1993
A subtyping relation ≤ between types is often accompanied by a typing rule, called subsumption: if term has type T and U , then . In presence of subsumption, well-typed does not codify its proof well typing. Since semantic interpretation most naturally defined induction on the structure proofs, problem coherence arises: different proofs same must have related meanings. We propose proof-theoretical, rewriting approach to this problem. focus F second-order lambda calculus with bounded...
Recent years have seen the widespread use of JSON as a data format to represent massive collections. collections are usually schemaless. While this ensures several advantages, absence schema information has important negative consequences: correctness complex queries and programs cannot be statically checked, users rely on quickly figure out structural properties that could speed up formulation correct queries, many schema-based optimizations not possible. In paper we deal with problem...
JSON Schema is the de-facto standard schema language for data. The went through many minor revisions, but most recent versions of language, starting from Draft 2019-09, added two novel features, dynamic references and annotation-dependent validation, that change evaluation model. Modern name used to indicate all which are characterized by these new while Classical previous versions. These “modern” features make quite difficult understand have generated discussions about correct...
The ambient logic is a modal that was proposed for the description of structural and computational properties distributed mobile computation. part is, essentially, labelled trees, hence it turns out to be good foundation query languages semistructured data, much in same way as first-order fitting relational languages. We define here language data based on logic, we outline an execution model this language. quite expressive. Its strong foundations equivalences hold are helpful definition...
We present a simple extension of typed λ-claculus where functions can be overloaded by adding different “pieces code”. In short, the code an function is formed several branches code; branch to execute chosen, when applied, according particular selection rule which depends on type argument. The crucial feature approach that subtyping relation defied among types, such term generally decreases during computation, and this fact induces distinction between “compile-time” “run-time”type term....
Type systems express structural information about data, are human readable and hence crucial for understanding code, endowed with a formal definition that makes them fundamental tool when proving program properties. Internal data structures of database store quantitative is essential optimization purposes, but not used documentation or correctness proofs. In this paper we propose new idea: raising part the from system-level to type level.
article Free AccessA static type system for message passing Share on Author: Giorgio Ghelli Dipartimento di Informatica, Università Pisa, Corso Italia 40, Italy ItalyView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 26Issue 11Nov. 1991 pp 129–145https://doi.org/10.1145/118014.117964Online:01 November 1991Publication History 26citation384DownloadsMetricsTotal Citations26Total Downloads384Last 12 Months11Last 6 weeks0 Get Citation AlertsNew Alert added!This alert has been...