Abstract Syntax and Logic Programming
نویسنده
چکیده
Syntax and Logic Programming Dale Miller University of Pennsylvania This paper is posted at ScholarlyCommons. http://repository.upenn.edu/cis reports/409 Abstract Syntax and Logic ProgrammingSyntax and Logic Programming MS-CIS-91-72 LINC LAB 209
منابع مشابه
[hal-00772522, v1] Relating nominal and higher-order abstract syntax specifications
Nominal abstract syntax and higher-order abstract syntax provide a means for describing binding structure which is higher-level than traditional techniques. These approaches have spawned two different communities which have developed along similar lines but with subtle differences that make them difficult to relate. The nominal abstract syntax community has devices like names, freshness, name-a...
متن کاملCategorical Description of Dynamic Fuzzy Logic Programming Language
First, this paper gives the relative basic theory of dynamic fuzzy logic, and introduces the basic data types of dynamic fuzzy logic. Then we introduce the basic data types of dynamic fuzzy logic and the abstract syntax of dynamic fuzzy logic programming language. At last, this paper gives the categorical description of dynamic fuzzy logic programming language according to categorical theory, a...
متن کاملTesting Concurrent Systems: An Interpretation of Intuitionistic Logic
We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programming (CCP, [Sar93]) as a fragment of (intuitionistic, higher-order) logic. This combination is motivated by the need for a simple executable, logical presentation for static and dynamic semantics of modern programming languages. T...
متن کاملA Logic for Reasoning with Higher-Order Abstract Syntax
Logical frameworks based on intuitionistic or linear logics with higher-type quantification have been successfully used to give high-level, modular, and formal specifications of many important judgments in the area of programming languages and inference systems. Given such specifications, it is natural to consider proving properties about the specified systems in the framework: for example, giv...
متن کاملAn overview of a proof theoretical approach to reasoning about computation
Typing rules and structural operational semantics are often given via inference rules: that is, the justification of a typing or an evaluation is actually a proof. Thus it is not surprising that proof theory can be used to benefit the specification of and the reasoning about computation. An additional advantage of using proof theory is that it can support such “intensional” aspects of computati...
متن کامل