A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
Some of these theorems are obtained via a detour through fragments of cyclic linear logic, and give rise to a substantial optimisation of standard proof search algorithms. ...
We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations ...
We warmly thank Olivier Laurent, Tom Hirschowitz and the Choco band for the highly stimulating discussions we had about this work. ...
doi:10.1007/978-3-642-15205-4_37
fatcat:mj4j4ui2evey3lgqkg5io4pxou
Untyping Typed Algebras and Colouring Cyclic Linear Logic
2012
Logical Methods in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Some of these theorems are obtained via a detour through fragments of cyclic linear logic, and give rise to a substantial optimisation of standard proof search algorithms. ...
We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations ...
We are grateful to Olivier Laurent and Tom Hirschowitz for the highly stimulating discussions we had on linear logic and about this work. ...
doi:10.2168/lmcs-8(2:13)2012
fatcat:kaevar7mnjbt7io2lvbcn5qzgi
Subject index volumes 1–200
1999
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
, 1122
second-order polymorphic h-calculus, 1664
Girard's
linear logic, 2148, 2188, 2203
model of polymorphism,
1294
proof nets, 2189
system F, 1078,2101,2312
system F, (3299
Gire, 1429
girth ...
-, 55 1
well-quasi-orderings,
1318
well-quasi-orders,
789
well-shaped segment, 3496
well-structured programs, 541
well-typed
formulae, 2146
programs, translation of -, 3009
terms, 1664
well-typedness ...
doi:10.1016/s0304-3975(98)00319-3
fatcat:s22ud3iiqjht7lfbtc3zctk7zm
Stellar Resolution: Multiplicatives
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We then explain how it can represent multiplicative proof-structures, their cut-elimination and the correctness criterion of Danos and Regnier. ...
Further use of realisability techniques lead to dynamic semantics for Multiplicative Linear Logic, following previous Geometry of Interaction models. ...
proofs in linear logic. ...
arXiv:2007.16077v1
fatcat:3bvzl6f42rcl7dvtb336ttntiq
Change actions: from incremental computation to discrete derivatives
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
of Ehrhard and Regnier's differential lambda-calculus. ...
To this end we define and explore the notions of change actions and differential maps between change actions and show how these notions relate to incremental computation through the concrete example of ...
On one hand, the theory of proof nets and, more generally, interaction nets [64, 46] , graphical formalisms for studying proofs and proof reduction in linear logic, have been extended to the differential ...
arXiv:2002.05256v2
fatcat:o6zzymbz5rcgbgamuqve2fkyou
Termination Analysis of Higher-Order Functional Programs
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This was proposed for strict firstorder programs, and a termination analysis of the pure untyped λ-calculus was subsequently obtained in this framework. ...
, in particular the simply-typed λ-calculus. ...
By the Curry-Howard isomorphism we may view types as logical formulae, and programs then represent proofs. ...
doi:10.1007/11575467_19
fatcat:xiqkc25wxvc3dg5grminbnmm6u
Organizing committee Sponsor
2008
Nordic Workshop on Programming Theory NWPT
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
logics, formal specification of programs, program verification, program construction, program transformation and refinement, real-time and hybrid systems, models of concurrent, distributed and mobile ...
The scope of the meetings covers traditional as well as emerging disciplines within programming theory: semantics of programming languages, programming language design and programming methodology, programming ...
We are grateful to the members of both projects for discussions on type systems and program logics for information flow. ...
fatcat:hoaq5jc5xzfrdmsnrvhbl7be34
Multilevel Modelling and Domain-Specific Languages
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
MTs can be exploited by MLM, becoming a precise and reusable definition of behaviour. ...
This thesis presents a MLM and Multilevel MT approach which tackles open issues in the field and compares it with the state of the art through literature review and experiments, providing its formalisation ...
We present a new version of Linear Temporal Logic which adds: (1) distributed evaluation of properties, (2) usage of explicit time constraints and (3) usage of a 4-valued boolean algebra which accounts ...
arXiv:1910.03313v2
fatcat:gw6zslbtxbdnfl5gyrdie46sbq
ON SYMBOLIC REPRESENTATIONS OF MUSIC Presentato da
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
logical structure. ...
Interpretation of the new algebra The interpretation of the given postulates leads to the definition of the formal structure of music. ...
represents the successor operator, λatom.type represents the type creation by classification and type 1 type 2 represents the summation of types. ...
fatcat:wqkl3aywcbefzj2b7plqlrwqyi
Set based failure diagnosis for concurrent constraint programming
[article]
2004
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
data structures, cells, and records, and we highlight the restrictions of Plain with respect to Oz. ...
We define Plain, and we show that an expressive strong type system is possible for a language that combines key features of Oz, namely higher-order procedures, logic variables and partially determined ...
This includes for instance boolean conditionals and boolean types, multiple-clause case-statements and variant types, and also recursive types as needed for cyclic data structures. ...
doi:10.22028/d291-25722
fatcat:wuc4nibn6natrcqcbgmi7svx5a
2015 Jahresbericht Annual Report
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We would like to thank Dagmar Glaser and the staff at Schloss Dagstuhl for their continuous support and great hospitality which was the basis for the success of this seminar.
Acknowledgements. ...
Martin Rinard for his support and contribution to the organization of the seminar. We thank Sara Achour for her help with preparing the full report. ...
Psd rank has inherent semi algebraic structure and its study crosses over into real and convex algebraic geometry, algebraic complexity, and semidefinite programming. ...
fatcat:tzkatxrngzbj7j3qvr7j7znvla
LIPIcs, Volume 11, ICLP'11, Complete Volume
[article]
2013
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements We acknowledge the support of Morgan Stanley Business and Technology Centre, Budapest in the development of the Q type checker system. We are especially grateful to Balázs G. ...
NICTA is funded by the Department of Broadband, Communications and the Digital Economy, and the Australian Research Council. ...
sizes, and net is the x-coordinate of the net. ...
doi:10.4230/lipics.iclp.2011
fatcat:3nmujmpwyzfibb4nlkgrofavee
A new Nested Graph Model for Data Integration
2018
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Proof. This corollary is proved by the linearity of ⊕. ...
Proof. This corollary is proved by the linearity of ⊕. ...
Therefore: Moreover, each of the v ′ c+1 must have the same label of v c (ℓ(v ′ c+1 ) ∶= ℓ(v c )) and must share its same attributes (φ(v ′ c+1 ) = φ(v c )). ...
doi:10.6092/unibo/amsdottorato/8348
fatcat:4tfvtyhvhngejolqpooseqrkqu
Applied mathematics, 16–19
[article]
2021
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The dissertation is concerned with the role or applied mathematics in the curriculum, 16–19, and considers the validity or reasons which are advanced for it to continue in that role. [Continues.] ...
had replaced laborious proof and rigidly logical sequence. ...
and map colouring. ...
doi:10.26174/thesis.lboro.13525844
fatcat:23jsarhngzc4rlq2ukrelcs5ie
Editorial Associate: Position Papers of the 2016 Federated Conference on Computer Science and Information Systems
Position Papers of the 2015 Federated Conference on Computer Science and Information Systems, ISBN WEB
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The latter propose and describe research challenges in theory or practice of computer science and information systems. ...
This is the forth year when position papers have been introduced as a separate category of contributions. They represent emerging research papers and challenge papers. ...
of methods, to discover the limits of this algorithm; and extra work to implement the parallel version, which uses the advantages of the divide and conquer method. ...
fatcat:qfmkssbttfhl7hzaa52qzgoshe
« Previous
Showing results 1 — 15 out of 19 results