Results 1 to 10 of about 173,804,276 (284)
Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion [PDF]
Logical Methods in Computer Science, 2012 We study the semantics of a resource-sensitive extension of the lambda calculus in a canonical reflexive object of a category of sets and relations, a relational version of Scott's original model of the pure lambda calculus.
Thomas Ehrhard +3 more
doaj +1 more source
Presentable signatures and initial semantics [PDF]
Logical Methods in Computer Science, 2021 We present a device for specifying and reasoning about syntax for datatypes, programming languages, and logic calculi. More precisely, we study a notion of "signature" for specifying syntactic constructions.
Benedikt Ahrens +3 more
doaj +1 more source
Nominal Coalgebraic Data Types with Applications to Lambda Calculus [PDF]
Logical Methods in Computer Science, 2013 We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.
Alexander Kurz +3 more
doaj +1 more source
Consistency and Completeness of Rewriting in the Calculus of Constructions [PDF]
Logical Methods in Computer Science, 2008 Adding rewriting to a proof assistant based on the Curry-Howard isomorphism, such as Coq, may greatly improve usability of the tool. Unfortunately adding an arbitrary set of rewrite rules may render the underlying formal system undecidable and ...
Daria Walukiewicz-Chrzaszcz +1 more
doaj +1 more source
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions [PDF]
Logical Methods in Computer Science, 2012 The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita.
Andrea Asperti +3 more
doaj +1 more source
A coinductive semantics of the Unlimited Register Machine [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We exploit (co)inductive specifications and proofs to approach the evaluation of low-level programs for the Unlimited Register Machine (URM) within the Coq system, a proof assistant based on the Calculus of (Co)Inductive Constructions type theory.
Alberto Ciaffaglione
doaj +1 more source
Monads need not be endofunctors [PDF]
Logical Methods in Computer Science, 2015 We introduce a generalization of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vector spaces, untyped and typed lambda-calculus syntax and indexed containers.
Thosten Altenkirch +2 more
doaj +1 more source
A weak HOAS approach to the POPLmark Challenge [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Capitalizing on previous encodings and formal developments about nominal calculi and type systems, we propose a weak Higher-Order Abstract Syntax formalization of the type language of pure System ...
Alberto Ciaffaglione, Ivan Scagnetto
doaj +1 more source
Serial verb constructions and covert coordinations in Edo – an analysis in Type Logical Grammar
Journal of Language Modelling, 2021 Based on both syntactic and semantic criteria, Stewart (2001) and, following him, Baker and Stewart (1999), distinguish two types of serial verb constructions (SVC) and one type of covert coordination (CC) in Edo.
Ralf Naumann, Thomas Gamerschlag
doaj +1 more source
Discrete Laplacian Operator and Its Applications in Signal Processing
IEEE Access, 2020 Fractional calculus has increased in popularity in recent years, as the number of its applications in different fields has increased. Compared to the traditional operations in calculus (integration and differentiation) which are uniquely defined, the ...
Waseem Waheed, Guang Deng, Bo Liu
doaj +1 more source