Zobrazeno 1 - 10
of 84
pro vyhledávání: '"Delia Kesner"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
We introduce a call-by-name lambda-calculus $\lambda Jn$ with generalized applications which is equipped with distant reduction. This allows to unblock $\beta$-redexes without resorting to the standard permutative conversions of generalized applicati
Externí odkaz:
https://doaj.org/article/a452807b5ef745c89148dd8613438de1
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 2 (2024)
When translating a term calculus into a graphical formalism many inessential details are abstracted away. In the case of $\lambda$-calculus translated to proof-nets, these inessential details are captured by a notion of equivalence on $\lambda$-terms
Externí odkaz:
https://doaj.org/article/80cd342013d4418e94dfa84ea397611f
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 1 (2024)
We define and study a term calculus implementing higher-order node replication. It is used to specify two different (weak) evaluation strategies: call-by-name and fully lazy call-by-need, that are shown to be observationally equivalent by using type
Externí odkaz:
https://doaj.org/article/d22c518106c640dcb26cd65b6643f2c8
Publikováno v:
Logical Methods in Computer Science, Vol Volume 17, Issue 1 (2021)
We extend the classical notion of solvability to a lambda-calculus equipped with pattern matching. We prove that solvability can be characterized by means of typability and inhabitation in an intersection type system P based on non-idempotent types.
Externí odkaz:
https://doaj.org/article/ca208024fc91482192d05c305ca3245f
Autor:
Delia Kesner, Pierre Vial
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 1 (2020)
In the first part of this paper, we define two resource aware typing systems for the {\lambda}{\mu}-calculus based on non-idempotent intersection and union types. The non-idempotent approach provides very simple combinatorial arguments-based on decre
Externí odkaz:
https://doaj.org/article/b4a15ed812b84bc28815b57be2ddab25
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 3 (2018)
The inhabitation problem for intersection types in the lambda-calculus is known to be undecidable. We study the problem in the case of non-idempotent intersection, considering several type assignment systems, which characterize the solvable or the st
Externí odkaz:
https://doaj.org/article/9e7e9ebbd19e4eada63c45ee9a1a43b5
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 49, Iss Proc. HOR 2010, Pp 58-72 (2011)
This work gives some insights and results on standardisation for call-by-name pattern calculi. More precisely, we define standard reductions for a pattern calculus with constructor-based data terms and patterns. This notion is based on reduction step
Externí odkaz:
https://doaj.org/article/a91e6783e3bd420f8d1545835aefa3e7
Autor:
Beniamino Accattoli, Delia Kesner
Publikováno v:
Logical Methods in Computer Science, Vol Volume 8, Issue 1 (2012)
Inspired by a recent graphical formalism for lambda-calculus based on linear logic technology, we introduce an untyped structural lambda-calculus, called lambda j, which combines actions at a distance with exponential rules decomposing the substituti
Externí odkaz:
https://doaj.org/article/ebb10c6f20614906b994067b4dd6d5bc
Autor:
Delia Kesner
Publikováno v:
Logical Methods in Computer Science, Vol Volume 5, Issue 3 (2009)
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the first part
Externí odkaz:
https://doaj.org/article/b1988220d9c14eb884d6ee9b398d8df8
Publikováno v:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, 2023, 7 (POPL), pp.1483-1513. ⟨10.1145/3571244⟩
Proceedings of the ACM on Programming Languages, 2023, 7 (POPL), pp.1483-1513. ⟨10.1145/3571244⟩
International audience; We solve the inhabitation problem for a language called λ!, a subsuming paradigm (inspired by call-by-push-value) being able to encode, among others, call-by-name and call-by-value strategies of functional programming. The ty
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb475668b566d02457357da53db602d4
https://doi.org/10.1145/3571244
https://doi.org/10.1145/3571244