Paula Severi

According to our database1, Paula Severi authored at least 38 papers between 1994 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
A Light Modality for Recursion.
Logical Methods in Computer Science, 2019

Observational Equivalence for Multiparty Sessions.
Fundam. Inform., 2019

A Description Logic for Unifying Different Points of View.
Proceedings of the Knowledge Graphs and Semantic Web - First Iberoamerican Conference, 2019

Meta-Modelling Ontology Design Pattern.
Proceedings of the Knowledge Graphs and Semantic Web - First Iberoamerican Conference, 2019

2018
Two Light Modalities for Recursion.
CoRR, 2018

Applying Meta-Modellig to an Accounting Application.
Proceedings of the XI Seminar on Ontology Research in Brazil and II Doctoral and Masters Consortium on Ontologies, 2018

2017
The infinitary lambda calculus of the infinite eta Böhm trees.
Mathematical Structures in Computer Science, 2017

Applying Description Logics Extended with Meta-modelling to SNOMED-CT.
Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, 2017

2016
On Sessions and Infinite Data.
CoRR, 2016

2015
The description logic SHIQ with a flexible meta-modelling hierarchy.
J. Web Semant., 2015

Complexity of the Description Logic ALCM.
CoRR, 2015

Approximation of Nested Fixpoints - A Coalgebraic View of Parametric Dataypes.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014
Reasoning for ALCQ extended with a flexible meta-modelling hierarchy.
CoRR, 2014

Reasoning for ALCQ Extended with a Flexible Meta-Modelling Hierarchy.
Proceedings of the Semantic Technology - 4th Joint International Conference, 2014

Metamodelling in a Ontology Network.
Proceedings of the 8th International Workshop on Modular Ontologies co-located with the 8th International Conference on Formal Ontology in Information Systems (FOIS 2014), 2014

2013
Nominal Coalgebraic Data Types with Applications to Lambda Calculus.
Logical Methods in Computer Science, 2013

Completeness of Conversion between Reactive Programs for Ultrametric Models.
Proceedings of the Typed Lambda Calculi and Applications, 11th International Conference, 2013

2012
Meaningless Sets in Infinitary Combinatory Logic.
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

Pure type systems with corecursion on streams: from finite to infinitary normalisation.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

An Alpha-Corecursion Principle for the Infinitary Lambda Calculus.
Proceedings of the Coalgebraic Methods in Computer Science - 11th International Workshop, 2012

2011
Guiding the representation of n-ary relations in ontologies through aggregation, generalisation and participation.
J. Web Semant., 2011

Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus.
Proceedings of the Logic, Language, Information and Computation, 2011

Weakening the Axiom of Overlap in Infinitary Lambda Calculus.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

2010
Guiding Reification in OWL through Aggregation.
Proceedings of the 23rd International Workshop on Description Logics (DL 2010), 2010

2008
Recursive Domain Equations of Filter Models.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

2005
Continuity and Discontinuity in Lambda Calculus.
Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

Order Structures on Böhm-Like Models.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

Infinitary Rewriting: From Syntax to Semantics.
Proceedings of the Processes, 2005

2003
Infinitary lambda calculus and discrimination of Berarducci trees.
Theor. Comput. Sci., 2003

Reduction Strategies for Program Extraction.
CLEI Electron. J., 2003

2002
Eliminating Proofs from Programs.
Electr. Notes Theor. Comput. Sci., 2002

An Extensional Böhm Model.
Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

An Operational Approach to Program Extraction in the Calculus of Constructions.
Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

2001
Studies of a Theory of Specifications with Built-in Program Extraction.
J. Autom. Reasoning, 2001

2000
Böhm's theorem for Berarducci trees.
Electr. Notes Theor. Comput. Sci., 2000

1999
Perpetual Reductions in Lambda-Calculus.
Inf. Comput., 1999

1998
Type Inference for Pure Type Systems.
Inf. Comput., 1998

1994
Pure Type Systems with Definitions.
Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994


  Loading...