Travelled to:
1 × Austria
1 × Canada
1 × Cyprus
1 × Finland
1 × Germany
1 × Greece
1 × USA
4 × Italy
Collaborated with:
M.Dezani-Ciancaglini ∅ F.Damiani P.Giannini M.Drocco M.Zacchi M.Aldinucci M.Torquati A.Troina B.Venneri P.Sallé S.R.D.Rocca C.Böhm L.Padovani N.Yoshida S.Berardi F.Tordini E.Grassi
Talks about:
type (7) calculus (4) multiparti (2) stochast (2) function (2) session (2) program (2) system (2) recurs (2) biolog (2)
Person: Mario Coppo
DBLP: Coppo:Mario
Contributed to:
Wrote 14 papers:
- SFM-2015-CoppoDPY #multi
- A Gentle Introduction to Multiparty Asynchronous Session Types (MC, MDC, LP, NY), pp. 146–178.
- PDP-2014-CoppoDV #adaptation #monitoring #multi #self
- Self-Adaptive Monitors for Multiparty Sessions (MC, MDC, BV), pp. 688–696.
- PDP-2013-AldinucciDTCT #biology #evolution #parallel #probability
- Parallel Stochastic Simulators in System Biology: The Evolution of the Species (MA, MD, FT, MC, MT), pp. 410–419.
- PDP-2011-AldinucciCDDTT #biology #design #multi #on the
- On Designing Multicore-Aware Simulators for Biological Systems (MA, MC, FD, MD, MT, AT), pp. 318–325.
- QAPL-2010-CoppoDDGT #calculus #probability
- Stochastic Calculus of Wrapped Compartments (MC, FD, MD, EG, AT), pp. 82–98.
- VMCAI-2002-CoppoD #higher-order #mobile
- A Fully Abstract Model for Higher-Order Mobile Ambients (MC, MDC), pp. 255–271.
- FoSSaCS-2001-Coppo #equation #recursion #type inference
- Type Inference with Recursive Type Equations (MC), pp. 184–198.
- SAIG-2000-BerardiCDG #functional #source code #type system
- Type-Based Useless-Code Elimination for Functional Programs (SB, MC, FD, PG), pp. 172–189.
- SAS-1996-CoppoDG #program analysis #refinement
- Refinement Types for Program Analysis (MC, FD, PG), pp. 143–158.
- LICS-1986-CoppoZ #logic #type inference
- Type inference and logical relations (MC, MZ), pp. 218–226.
- ICALP-1985-Coppo #recursion #theorem
- A Completeness Theorem for Recursively Defined Types (MC), pp. 120–129.
- ICALP-1979-CoppoDS #functional #semantics #λ-calculus
- Functional Characterization of Some Semantic Equalities inside λ-Calculus (MC, MDC, PS), pp. 133–146.
- ICALP-1978-CoppoDR #finite #set #λ-calculus
- (Semi)-separability of Finite Sets of Terms in Scott’s D∞-Models of the λ-Calculus (MC, MDC, SRDR), pp. 142–164.
- ICALP-1977-BohmCD #termination #testing #λ-calculus
- Termination Tests inside λ-Calculus (CB, MC, MDC), pp. 95–110.