Results 1  10
of
2,803,491
A CurryHoward foundation for functional computation with control
 In Proceedings of ACM SIGPLANSIGACT Symposium on Principle of Programming Languages
, 1997
"... We introduce the type theory ¯ v , a callbyvalue variant of Parigot's ¯calculus, as a CurryHoward representation theory of classical propositional proofs. The associated rewrite system is ChurchRosser and strongly normalizing, and definitional equality of the type theory is consistent, com ..."
Abstract

Cited by 93 (3 self)
 Add to MetaCart
We introduce the type theory ¯ v , a callbyvalue variant of Parigot's ¯calculus, as a CurryHoward representation theory of classical propositional proofs. The associated rewrite system is ChurchRosser and strongly normalizing, and definitional equality of the type theory is consistent
CurryHoward
"... for incomplete firstorder logic derivations using oneandahalf level terms ..."
Abstract
 Add to MetaCart
for incomplete firstorder logic derivations using oneandahalf level terms
Lectures on the curryhoward isomorphism
, 1998
"... The CurryHoward isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. For instance, minimal propositional logic corresponds to simply typed λcalculus, firstorder logic corresponds to dependent ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
The CurryHoward isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. For instance, minimal propositional logic corresponds to simply typed λcalculus, firstorder logic corresponds
A presentation of the CurryHoward Correspondance.
, 1997
"... These notes are extracted from the rst version of the paper iFrom Computation to Foundations: the calculus and its webbed modelsj. They nearly disappeared in the revised version of that paper, and we make them available separately. 0.1 calculus as a foundation for Programming Theory. calculu ..."
Abstract
 Add to MetaCart
These notes are extracted from the rst version of the paper iFrom Computation to Foundations: the calculus and its webbed modelsj. They nearly disappeared in the revised version of that paper, and we make them available separately. 0.1 calculus as a foundation for Programming Theory
Putting CurryHoward to work
 In Proceedings of ACM Workshop on
, 2005
"... Abstract The CurryHoward isomorphism states that types are propositionsand that programs are proofs. This allows programmers to state and enforce invariants of programs by using types. Unfortunately,the type systems of today's functional languages cannot directly express interesting properties ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
Abstract The CurryHoward isomorphism states that types are propositionsand that programs are proofs. This allows programmers to state and enforce invariants of programs by using types. Unfortunately,the type systems of today's functional languages cannot directly express interesting
The limits of the CurryHoward isomorphism
, 2013
"... The wellknown CurryHoward isomorphism relates functions with proofs and can be considered as one of the conceptional bases of MartinLöf’s type theory. For our considerations, the crucial correspondence is the one between (intuitionistic) proofs of an implication A → B and functions of the type A ..."
Abstract
 Add to MetaCart
The wellknown CurryHoward isomorphism relates functions with proofs and can be considered as one of the conceptional bases of MartinLöf’s type theory. For our considerations, the crucial correspondence is the one between (intuitionistic) proofs of an implication A → B and functions of the type
Foundations for the Study of Software Architecture
 ACM SIGSOFT SOFTWARE ENGINEERING NOTES
, 1992
"... The purpose of this paper is to build the foundation for software architecture. We first develop an intuition for software architecture by appealing to several wellestablished architectural disciplines. On the basis of this intuition, we present a model of software architecture that consists of th ..."
Abstract

Cited by 784 (35 self)
 Add to MetaCart
The purpose of this paper is to build the foundation for software architecture. We first develop an intuition for software architecture by appealing to several wellestablished architectural disciplines. On the basis of this intuition, we present a model of software architecture that consists
The Logical Abstract Machine: a CurryHoward isomorphism for machine code
 In A. Middeldorp and T. Sato, Eds., Proc. Fuji International Symposium on Functional and Logic Programming (FLOPS ’01), LNCS 1722
, 1999
"... Abstract. This paper presents a logical framework for lowlevel machine code and code generation. We first define a calculus, called sequential sequent calculus, of intuitionistic propositional logic. A proof of the calculus only contains left rules and has a linear (nonbranching) structure, whi ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
ture, which reflects the properties of sequential machine code. We then establish a CurryHoward isomorphism between this proof system and machine code based on the following observation. An ordinary machine instruction corresponds to a polymorphic proof transformer that extends a given proof with one
Extending the CurryHoward interpretation to linear, relevance and other resource logics
 JOURNAL OF SYMBOLIC LOGIC
, 1992
"... ..."
Results 1  10
of
2,803,491