4978 search results - page 77 / 996 » Logical models of argument |
100
click to vote
ENTCS
2007
15 years 3 months ago
2007
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...
124
Voted
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
125
Voted
PLPV
2010
ACM
16 years 12 days ago
2010
ACM
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...
134
click to vote
PPDP
2009
Springer
15 years 10 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
109
click to vote
TABLEAUX
2007
Springer
15 years 9 months ago
2007
Springer
Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with...